/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 02:29:30,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 02:29:30,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-22 02:29:30,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 02:29:30,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 02:29:30,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 02:29:30,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 02:29:30,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 02:29:30,793 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 02:29:30,796 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 02:29:30,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 02:29:30,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 02:29:30,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 02:29:30,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 02:29:30,798 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 02:29:30,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 02:29:30,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 02:29:30,799 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 02:29:30,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 02:29:30,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 02:29:30,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 02:29:30,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 02:29:30,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 02:29:30,800 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 02:29:30,800 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 02:29:30,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 02:29:30,800 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 02:29:30,800 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 02:29:30,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 02:29:30,800 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 02:29:30,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 02:29:30,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 02:29:30,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 02:29:30,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 02:29:30,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:29:30,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 02:29:30,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 02:29:30,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 02:29:30,802 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 02:29:30,802 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 02:29:30,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 02:29:30,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 02:29:30,803 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 02:29:30,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 02:29:30,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 02:29:30,803 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 02:29:30,803 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-22 02:29:30,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 02:29:30,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 02:29:30,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 02:29:30,998 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 02:29:30,998 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 02:29:30,999 INFO L431 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.03.cil-2.c [2023-12-22 02:29:32,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 02:29:32,221 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 02:29:32,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-2.c [2023-12-22 02:29:32,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b3614c4a/8365a15b93554d3fb9a72f2262d01995/FLAGacb5ad80a [2023-12-22 02:29:32,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b3614c4a/8365a15b93554d3fb9a72f2262d01995 [2023-12-22 02:29:32,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 02:29:32,249 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 02:29:32,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 02:29:32,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 02:29:32,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 02:29:32,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:29:32" (1/1) ... [2023-12-22 02:29:32,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c354625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:32, skipping insertion in model container [2023-12-22 02:29:32,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:29:32" (1/1) ... [2023-12-22 02:29:32,298 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 02:29:32,415 WARN L239 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.03.cil-2.c[913,926] [2023-12-22 02:29:32,447 WARN L239 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.03.cil-2.c[5977,5990] [2023-12-22 02:29:32,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:29:32,493 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 02:29:32,501 WARN L239 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.03.cil-2.c[913,926] [2023-12-22 02:29:32,511 WARN L239 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.03.cil-2.c[5977,5990] [2023-12-22 02:29:32,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:29:32,547 INFO L206 MainTranslator]: Completed translation [2023-12-22 02:29:32,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:32 WrapperNode [2023-12-22 02:29:32,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 02:29:32,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 02:29:32,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 02:29:32,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 02:29:32,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:32" (1/1) ... [2023-12-22 02:29:32,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:32" (1/1) ... [2023-12-22 02:29:32,589 INFO L138 Inliner]: procedures = 55, calls = 57, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 520 [2023-12-22 02:29:32,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 02:29:32,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 02:29:32,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 02:29:32,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 02:29:32,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:32" (1/1) ... [2023-12-22 02:29:32,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:32" (1/1) ... [2023-12-22 02:29:32,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:32" (1/1) ... [2023-12-22 02:29:32,616 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-22 02:29:32,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:32" (1/1) ... [2023-12-22 02:29:32,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:32" (1/1) ... [2023-12-22 02:29:32,623 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:32" (1/1) ... [2023-12-22 02:29:32,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:32" (1/1) ... [2023-12-22 02:29:32,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:32" (1/1) ... [2023-12-22 02:29:32,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:32" (1/1) ... [2023-12-22 02:29:32,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 02:29:32,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 02:29:32,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 02:29:32,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 02:29:32,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:32" (1/1) ... [2023-12-22 02:29:32,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:29:32,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 02:29:32,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-22 02:29:32,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-22 02:29:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 02:29:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-22 02:29:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-22 02:29:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2023-12-22 02:29:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2023-12-22 02:29:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-22 02:29:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-22 02:29:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-22 02:29:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-22 02:29:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-22 02:29:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-22 02:29:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-22 02:29:32,697 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-22 02:29:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 02:29:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-22 02:29:32,697 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-22 02:29:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-22 02:29:32,697 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-22 02:29:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 02:29:32,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 02:29:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-22 02:29:32,697 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-22 02:29:32,778 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 02:29:32,779 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 02:29:33,226 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 02:29:33,259 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 02:29:33,259 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-12-22 02:29:33,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:29:33 BoogieIcfgContainer [2023-12-22 02:29:33,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 02:29:33,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 02:29:33,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 02:29:33,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 02:29:33,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 02:29:32" (1/3) ... [2023-12-22 02:29:33,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a4e24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:29:33, skipping insertion in model container [2023-12-22 02:29:33,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:32" (2/3) ... [2023-12-22 02:29:33,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a4e24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:29:33, skipping insertion in model container [2023-12-22 02:29:33,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:29:33" (3/3) ... [2023-12-22 02:29:33,265 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.03.cil-2.c [2023-12-22 02:29:33,277 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 02:29:33,277 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-22 02:29:33,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 02:29:33,317 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3adf1493, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 02:29:33,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-22 02:29:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 169 states have (on average 1.668639053254438) internal successors, (282), 174 states have internal predecessors, (282), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-22 02:29:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-22 02:29:33,339 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:33,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:33,340 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:33,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:33,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1406468176, now seen corresponding path program 1 times [2023-12-22 02:29:33,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:33,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415235846] [2023-12-22 02:29:33,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:33,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:33,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:33,370 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:33,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-22 02:29:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:33,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:33,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:33,519 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:33,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:33,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415235846] [2023-12-22 02:29:33,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415235846] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:33,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:33,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:33,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614832166] [2023-12-22 02:29:33,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:33,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:33,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:33,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:33,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:33,555 INFO L87 Difference]: Start difference. First operand has 204 states, 169 states have (on average 1.668639053254438) internal successors, (282), 174 states have internal predecessors, (282), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-12-22 02:29:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:33,718 INFO L93 Difference]: Finished difference Result 448 states and 723 transitions. [2023-12-22 02:29:33,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:33,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 37 [2023-12-22 02:29:33,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:33,730 INFO L225 Difference]: With dead ends: 448 [2023-12-22 02:29:33,730 INFO L226 Difference]: Without dead ends: 252 [2023-12-22 02:29:33,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:33,738 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 281 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:33,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 359 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:33,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-12-22 02:29:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2023-12-22 02:29:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 209 states have (on average 1.507177033492823) internal successors, (315), 212 states have internal predecessors, (315), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (29), 25 states have call predecessors, (29), 25 states have call successors, (29) [2023-12-22 02:29:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 371 transitions. [2023-12-22 02:29:33,784 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 371 transitions. Word has length 37 [2023-12-22 02:29:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:33,784 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 371 transitions. [2023-12-22 02:29:33,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-12-22 02:29:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 371 transitions. [2023-12-22 02:29:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-22 02:29:33,787 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:33,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:33,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:33,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:33,993 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:33,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:33,994 INFO L85 PathProgramCache]: Analyzing trace with hash 554812386, now seen corresponding path program 1 times [2023-12-22 02:29:33,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:33,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978719728] [2023-12-22 02:29:33,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:33,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:33,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:34,005 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:34,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-22 02:29:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:34,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:34,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:34,133 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:34,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:34,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978719728] [2023-12-22 02:29:34,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978719728] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:34,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:34,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:34,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79108709] [2023-12-22 02:29:34,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:34,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:34,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:34,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:34,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:34,136 INFO L87 Difference]: Start difference. First operand 248 states and 371 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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) [2023-12-22 02:29:34,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:34,194 INFO L93 Difference]: Finished difference Result 448 states and 663 transitions. [2023-12-22 02:29:34,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:34,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 38 [2023-12-22 02:29:34,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:34,198 INFO L225 Difference]: With dead ends: 448 [2023-12-22 02:29:34,198 INFO L226 Difference]: Without dead ends: 345 [2023-12-22 02:29:34,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:34,199 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 273 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:34,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 340 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-12-22 02:29:34,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2023-12-22 02:29:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 290 states have (on average 1.4689655172413794) internal successors, (426), 293 states have internal predecessors, (426), 35 states have call successors, (35), 15 states have call predecessors, (35), 14 states have return successors, (41), 33 states have call predecessors, (41), 33 states have call successors, (41) [2023-12-22 02:29:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 502 transitions. [2023-12-22 02:29:34,224 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 502 transitions. Word has length 38 [2023-12-22 02:29:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:34,224 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 502 transitions. [2023-12-22 02:29:34,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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) [2023-12-22 02:29:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 502 transitions. [2023-12-22 02:29:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-22 02:29:34,226 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:34,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:34,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:34,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:34,430 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:34,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:34,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1211272443, now seen corresponding path program 1 times [2023-12-22 02:29:34,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:34,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921274418] [2023-12-22 02:29:34,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:34,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:34,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:34,439 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:34,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-22 02:29:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:34,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:34,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:34,558 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:34,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:34,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921274418] [2023-12-22 02:29:34,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921274418] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:34,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:34,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:34,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083966373] [2023-12-22 02:29:34,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:34,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:34,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:34,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:34,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:34,560 INFO L87 Difference]: Start difference. First operand 341 states and 502 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2023-12-22 02:29:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:34,634 INFO L93 Difference]: Finished difference Result 693 states and 999 transitions. [2023-12-22 02:29:34,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:34,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 39 [2023-12-22 02:29:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:34,640 INFO L225 Difference]: With dead ends: 693 [2023-12-22 02:29:34,640 INFO L226 Difference]: Without dead ends: 497 [2023-12-22 02:29:34,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:34,645 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 58 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:34,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 548 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2023-12-22 02:29:34,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 446. [2023-12-22 02:29:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 383 states have (on average 1.4490861618798956) internal successors, (555), 388 states have internal predecessors, (555), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (49), 37 states have call predecessors, (49), 39 states have call successors, (49) [2023-12-22 02:29:34,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 645 transitions. [2023-12-22 02:29:34,684 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 645 transitions. Word has length 39 [2023-12-22 02:29:34,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:34,684 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 645 transitions. [2023-12-22 02:29:34,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2023-12-22 02:29:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 645 transitions. [2023-12-22 02:29:34,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-22 02:29:34,692 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:34,692 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:34,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:34,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:34,895 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:34,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash -627017791, now seen corresponding path program 1 times [2023-12-22 02:29:34,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:34,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424955008] [2023-12-22 02:29:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:34,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:34,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:34,901 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:34,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-22 02:29:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:34,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:34,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:34,994 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:34,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:34,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424955008] [2023-12-22 02:29:34,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424955008] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:34,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:34,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:34,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079295869] [2023-12-22 02:29:34,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:34,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:34,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:34,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:34,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:34,996 INFO L87 Difference]: Start difference. First operand 446 states and 645 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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) [2023-12-22 02:29:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:35,065 INFO L93 Difference]: Finished difference Result 898 states and 1282 transitions. [2023-12-22 02:29:35,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:35,066 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), 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 54 [2023-12-22 02:29:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:35,068 INFO L225 Difference]: With dead ends: 898 [2023-12-22 02:29:35,068 INFO L226 Difference]: Without dead ends: 597 [2023-12-22 02:29:35,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:35,070 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 46 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:35,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 587 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2023-12-22 02:29:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2023-12-22 02:29:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 512 states have (on average 1.39453125) internal successors, (714), 517 states have internal predecessors, (714), 55 states have call successors, (55), 29 states have call predecessors, (55), 28 states have return successors, (71), 51 states have call predecessors, (71), 53 states have call successors, (71) [2023-12-22 02:29:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 840 transitions. [2023-12-22 02:29:35,094 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 840 transitions. Word has length 54 [2023-12-22 02:29:35,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:35,095 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 840 transitions. [2023-12-22 02:29:35,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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) [2023-12-22 02:29:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 840 transitions. [2023-12-22 02:29:35,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-22 02:29:35,096 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:35,096 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:29:35,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-22 02:29:35,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:35,300 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:35,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:35,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2134171021, now seen corresponding path program 1 times [2023-12-22 02:29:35,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:35,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503615694] [2023-12-22 02:29:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:35,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:35,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:35,302 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:35,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-22 02:29:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:35,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:35,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 02:29:35,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:35,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:35,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503615694] [2023-12-22 02:29:35,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503615694] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:35,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:35,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:35,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048973822] [2023-12-22 02:29:35,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:35,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:35,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:35,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:35,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:35,412 INFO L87 Difference]: Start difference. First operand 597 states and 840 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) [2023-12-22 02:29:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:35,489 INFO L93 Difference]: Finished difference Result 1082 states and 1499 transitions. [2023-12-22 02:29:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:35,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 59 [2023-12-22 02:29:35,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:35,493 INFO L225 Difference]: With dead ends: 1082 [2023-12-22 02:29:35,494 INFO L226 Difference]: Without dead ends: 710 [2023-12-22 02:29:35,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:35,496 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 260 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:35,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 344 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:35,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2023-12-22 02:29:35,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2023-12-22 02:29:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 611 states have (on average 1.3617021276595744) internal successors, (832), 616 states have internal predecessors, (832), 63 states have call successors, (63), 35 states have call predecessors, (63), 34 states have return successors, (83), 59 states have call predecessors, (83), 61 states have call successors, (83) [2023-12-22 02:29:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 978 transitions. [2023-12-22 02:29:35,525 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 978 transitions. Word has length 59 [2023-12-22 02:29:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:35,525 INFO L495 AbstractCegarLoop]: Abstraction has 710 states and 978 transitions. [2023-12-22 02:29:35,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) [2023-12-22 02:29:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 978 transitions. [2023-12-22 02:29:35,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-22 02:29:35,528 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:35,528 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:35,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-22 02:29:35,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:35,731 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:35,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:35,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1511810339, now seen corresponding path program 1 times [2023-12-22 02:29:35,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:35,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474764115] [2023-12-22 02:29:35,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:35,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:35,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:35,734 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:35,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-22 02:29:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:35,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:35,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:35,812 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-22 02:29:35,812 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:35,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:35,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474764115] [2023-12-22 02:29:35,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474764115] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:35,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:35,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:35,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368651886] [2023-12-22 02:29:35,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:35,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:35,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:35,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:35,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:35,813 INFO L87 Difference]: Start difference. First operand 710 states and 978 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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) [2023-12-22 02:29:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:35,931 INFO L93 Difference]: Finished difference Result 1209 states and 1667 transitions. [2023-12-22 02:29:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:35,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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 60 [2023-12-22 02:29:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:35,935 INFO L225 Difference]: With dead ends: 1209 [2023-12-22 02:29:35,935 INFO L226 Difference]: Without dead ends: 771 [2023-12-22 02:29:35,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:35,936 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 11 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:35,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 820 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:35,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2023-12-22 02:29:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 741. [2023-12-22 02:29:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 640 states have (on average 1.3453125) internal successors, (861), 647 states have internal predecessors, (861), 63 states have call successors, (63), 35 states have call predecessors, (63), 36 states have return successors, (85), 59 states have call predecessors, (85), 61 states have call successors, (85) [2023-12-22 02:29:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1009 transitions. [2023-12-22 02:29:35,971 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1009 transitions. Word has length 60 [2023-12-22 02:29:35,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:35,971 INFO L495 AbstractCegarLoop]: Abstraction has 741 states and 1009 transitions. [2023-12-22 02:29:35,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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) [2023-12-22 02:29:35,971 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1009 transitions. [2023-12-22 02:29:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-22 02:29:35,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:35,973 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:35,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:36,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:36,177 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:36,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:36,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1939151455, now seen corresponding path program 1 times [2023-12-22 02:29:36,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:36,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013255985] [2023-12-22 02:29:36,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:36,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:36,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:36,179 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:36,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-22 02:29:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:36,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:36,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-22 02:29:36,293 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:36,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:36,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013255985] [2023-12-22 02:29:36,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013255985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:36,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:36,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:36,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128297020] [2023-12-22 02:29:36,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:36,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:36,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:36,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:36,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:36,294 INFO L87 Difference]: Start difference. First operand 741 states and 1009 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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) [2023-12-22 02:29:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:36,373 INFO L93 Difference]: Finished difference Result 1158 states and 1578 transitions. [2023-12-22 02:29:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:36,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 60 [2023-12-22 02:29:36,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:36,377 INFO L225 Difference]: With dead ends: 1158 [2023-12-22 02:29:36,377 INFO L226 Difference]: Without dead ends: 648 [2023-12-22 02:29:36,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:36,379 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 2 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:36,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 817 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2023-12-22 02:29:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 642. [2023-12-22 02:29:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 555 states have (on average 1.3441441441441442) internal successors, (746), 564 states have internal predecessors, (746), 53 states have call successors, (53), 29 states have call predecessors, (53), 32 states have return successors, (71), 49 states have call predecessors, (71), 51 states have call successors, (71) [2023-12-22 02:29:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 870 transitions. [2023-12-22 02:29:36,400 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 870 transitions. Word has length 60 [2023-12-22 02:29:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:36,401 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 870 transitions. [2023-12-22 02:29:36,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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) [2023-12-22 02:29:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 870 transitions. [2023-12-22 02:29:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-22 02:29:36,402 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:36,402 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:36,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-22 02:29:36,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:36,605 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:36,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:36,606 INFO L85 PathProgramCache]: Analyzing trace with hash -558176225, now seen corresponding path program 1 times [2023-12-22 02:29:36,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:36,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424171144] [2023-12-22 02:29:36,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:36,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:36,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:36,607 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:36,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-22 02:29:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:36,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:36,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:36,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:29:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-22 02:29:36,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:36,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424171144] [2023-12-22 02:29:36,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424171144] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 02:29:36,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 02:29:36,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-12-22 02:29:36,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814047889] [2023-12-22 02:29:36,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:36,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:36,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:36,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:36,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:36,767 INFO L87 Difference]: Start difference. First operand 642 states and 870 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2023-12-22 02:29:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:36,899 INFO L93 Difference]: Finished difference Result 691 states and 931 transitions. [2023-12-22 02:29:36,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:36,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 60 [2023-12-22 02:29:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:36,902 INFO L225 Difference]: With dead ends: 691 [2023-12-22 02:29:36,902 INFO L226 Difference]: Without dead ends: 688 [2023-12-22 02:29:36,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:36,903 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 515 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:36,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 346 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2023-12-22 02:29:36,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 641. [2023-12-22 02:29:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 555 states have (on average 1.3405405405405406) internal successors, (744), 563 states have internal predecessors, (744), 52 states have call successors, (52), 29 states have call predecessors, (52), 32 states have return successors, (71), 49 states have call predecessors, (71), 51 states have call successors, (71) [2023-12-22 02:29:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 867 transitions. [2023-12-22 02:29:36,930 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 867 transitions. Word has length 60 [2023-12-22 02:29:36,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:36,931 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 867 transitions. [2023-12-22 02:29:36,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2023-12-22 02:29:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 867 transitions. [2023-12-22 02:29:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:29:36,933 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:36,933 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:36,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-22 02:29:37,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:37,136 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:37,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:37,137 INFO L85 PathProgramCache]: Analyzing trace with hash -124330418, now seen corresponding path program 1 times [2023-12-22 02:29:37,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:37,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087554222] [2023-12-22 02:29:37,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:37,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:37,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:37,138 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:37,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-22 02:29:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:37,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:29:37,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:37,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:29:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-22 02:29:37,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:37,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087554222] [2023-12-22 02:29:37,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087554222] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 02:29:37,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 02:29:37,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2023-12-22 02:29:37,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084383769] [2023-12-22 02:29:37,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 02:29:37,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-22 02:29:37,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:37,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-22 02:29:37,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:29:37,486 INFO L87 Difference]: Start difference. First operand 641 states and 867 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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) [2023-12-22 02:29:37,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:37,758 INFO L93 Difference]: Finished difference Result 1360 states and 1805 transitions. [2023-12-22 02:29:37,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 02:29:37,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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 61 [2023-12-22 02:29:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:37,764 INFO L225 Difference]: With dead ends: 1360 [2023-12-22 02:29:37,764 INFO L226 Difference]: Without dead ends: 1357 [2023-12-22 02:29:37,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:29:37,766 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 421 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:37,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1402 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2023-12-22 02:29:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 944. [2023-12-22 02:29:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 822 states have (on average 1.3260340632603407) internal successors, (1090), 836 states have internal predecessors, (1090), 71 states have call successors, (71), 42 states have call predecessors, (71), 49 states have return successors, (102), 66 states have call predecessors, (102), 70 states have call successors, (102) [2023-12-22 02:29:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1263 transitions. [2023-12-22 02:29:37,841 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1263 transitions. Word has length 61 [2023-12-22 02:29:37,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:37,842 INFO L495 AbstractCegarLoop]: Abstraction has 944 states and 1263 transitions. [2023-12-22 02:29:37,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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) [2023-12-22 02:29:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1263 transitions. [2023-12-22 02:29:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:29:37,844 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:37,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:37,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:38,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:38,048 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:38,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:38,048 INFO L85 PathProgramCache]: Analyzing trace with hash -680097912, now seen corresponding path program 1 times [2023-12-22 02:29:38,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:38,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452724732] [2023-12-22 02:29:38,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:38,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:38,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:38,050 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:38,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-22 02:29:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:38,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:38,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:38,182 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:38,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:38,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452724732] [2023-12-22 02:29:38,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452724732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:38,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:38,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:38,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880673935] [2023-12-22 02:29:38,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:38,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:38,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:38,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:38,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:38,184 INFO L87 Difference]: Start difference. First operand 944 states and 1263 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 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) [2023-12-22 02:29:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:38,558 INFO L93 Difference]: Finished difference Result 1217 states and 1686 transitions. [2023-12-22 02:29:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:29:38,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 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 71 [2023-12-22 02:29:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:38,562 INFO L225 Difference]: With dead ends: 1217 [2023-12-22 02:29:38,562 INFO L226 Difference]: Without dead ends: 1087 [2023-12-22 02:29:38,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:29:38,563 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 469 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:38,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 656 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:29:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2023-12-22 02:29:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1076. [2023-12-22 02:29:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 935 states have (on average 1.3550802139037432) internal successors, (1267), 950 states have internal predecessors, (1267), 83 states have call successors, (83), 48 states have call predecessors, (83), 56 states have return successors, (115), 78 states have call predecessors, (115), 82 states have call successors, (115) [2023-12-22 02:29:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1465 transitions. [2023-12-22 02:29:38,611 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1465 transitions. Word has length 71 [2023-12-22 02:29:38,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:38,612 INFO L495 AbstractCegarLoop]: Abstraction has 1076 states and 1465 transitions. [2023-12-22 02:29:38,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 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) [2023-12-22 02:29:38,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1465 transitions. [2023-12-22 02:29:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:29:38,613 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:38,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:38,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:38,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:38,817 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:38,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash 21150476, now seen corresponding path program 1 times [2023-12-22 02:29:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:38,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216364113] [2023-12-22 02:29:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:38,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:38,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:38,819 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:38,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-22 02:29:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:38,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:38,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:38,919 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:38,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:38,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216364113] [2023-12-22 02:29:38,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216364113] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:38,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:38,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:38,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557144267] [2023-12-22 02:29:38,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:38,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:38,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:38,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:38,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:38,921 INFO L87 Difference]: Start difference. First operand 1076 states and 1465 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:39,183 INFO L93 Difference]: Finished difference Result 1338 states and 1872 transitions. [2023-12-22 02:29:39,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:39,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2023-12-22 02:29:39,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:39,187 INFO L225 Difference]: With dead ends: 1338 [2023-12-22 02:29:39,187 INFO L226 Difference]: Without dead ends: 1076 [2023-12-22 02:29:39,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:29:39,188 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 367 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:39,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 459 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:39,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2023-12-22 02:29:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1076. [2023-12-22 02:29:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 935 states have (on average 1.3475935828877006) internal successors, (1260), 950 states have internal predecessors, (1260), 83 states have call successors, (83), 48 states have call predecessors, (83), 56 states have return successors, (115), 78 states have call predecessors, (115), 82 states have call successors, (115) [2023-12-22 02:29:39,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1458 transitions. [2023-12-22 02:29:39,240 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1458 transitions. Word has length 71 [2023-12-22 02:29:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:39,241 INFO L495 AbstractCegarLoop]: Abstraction has 1076 states and 1458 transitions. [2023-12-22 02:29:39,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1458 transitions. [2023-12-22 02:29:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:29:39,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:39,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:39,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:39,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:39,466 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:39,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:39,466 INFO L85 PathProgramCache]: Analyzing trace with hash 320866056, now seen corresponding path program 1 times [2023-12-22 02:29:39,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:39,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011692614] [2023-12-22 02:29:39,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:39,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:39,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:39,477 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:39,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-22 02:29:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:39,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:39,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:39,574 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:39,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:39,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011692614] [2023-12-22 02:29:39,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011692614] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:39,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:39,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:39,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799629966] [2023-12-22 02:29:39,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:39,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:39,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:39,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:39,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:39,575 INFO L87 Difference]: Start difference. First operand 1076 states and 1458 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:39,847 INFO L93 Difference]: Finished difference Result 1338 states and 1858 transitions. [2023-12-22 02:29:39,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:39,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2023-12-22 02:29:39,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:39,852 INFO L225 Difference]: With dead ends: 1338 [2023-12-22 02:29:39,852 INFO L226 Difference]: Without dead ends: 1076 [2023-12-22 02:29:39,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:29:39,854 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 360 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:39,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 452 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2023-12-22 02:29:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1076. [2023-12-22 02:29:39,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 935 states have (on average 1.3401069518716577) internal successors, (1253), 950 states have internal predecessors, (1253), 83 states have call successors, (83), 48 states have call predecessors, (83), 56 states have return successors, (115), 78 states have call predecessors, (115), 82 states have call successors, (115) [2023-12-22 02:29:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1451 transitions. [2023-12-22 02:29:39,918 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1451 transitions. Word has length 71 [2023-12-22 02:29:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:39,918 INFO L495 AbstractCegarLoop]: Abstraction has 1076 states and 1451 transitions. [2023-12-22 02:29:39,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1451 transitions. [2023-12-22 02:29:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:29:39,920 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:39,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:39,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:40,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:40,123 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:40,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash 580395524, now seen corresponding path program 1 times [2023-12-22 02:29:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:40,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104518153] [2023-12-22 02:29:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:40,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:40,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:40,140 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:40,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-22 02:29:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:40,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:40,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:40,244 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:40,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:40,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104518153] [2023-12-22 02:29:40,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104518153] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:40,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:40,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:40,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395190844] [2023-12-22 02:29:40,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:40,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:40,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:40,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:40,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:40,246 INFO L87 Difference]: Start difference. First operand 1076 states and 1451 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:40,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:40,547 INFO L93 Difference]: Finished difference Result 1396 states and 1936 transitions. [2023-12-22 02:29:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:40,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2023-12-22 02:29:40,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:40,551 INFO L225 Difference]: With dead ends: 1396 [2023-12-22 02:29:40,551 INFO L226 Difference]: Without dead ends: 1134 [2023-12-22 02:29:40,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:29:40,552 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 387 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:40,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 446 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:40,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2023-12-22 02:29:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1134. [2023-12-22 02:29:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 987 states have (on average 1.337386018237082) internal successors, (1320), 1002 states have internal predecessors, (1320), 85 states have call successors, (85), 52 states have call predecessors, (85), 60 states have return successors, (117), 80 states have call predecessors, (117), 84 states have call successors, (117) [2023-12-22 02:29:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1522 transitions. [2023-12-22 02:29:40,631 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1522 transitions. Word has length 71 [2023-12-22 02:29:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:40,631 INFO L495 AbstractCegarLoop]: Abstraction has 1134 states and 1522 transitions. [2023-12-22 02:29:40,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1522 transitions. [2023-12-22 02:29:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:29:40,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:40,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:40,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:40,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:40,843 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:40,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:40,843 INFO L85 PathProgramCache]: Analyzing trace with hash 496440585, now seen corresponding path program 1 times [2023-12-22 02:29:40,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:40,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790451557] [2023-12-22 02:29:40,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:40,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:40,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:40,861 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:40,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-22 02:29:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:40,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:40,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:40,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:40,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:40,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790451557] [2023-12-22 02:29:40,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790451557] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:40,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:40,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:40,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344490281] [2023-12-22 02:29:40,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:40,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:40,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:40,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:40,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:40,959 INFO L87 Difference]: Start difference. First operand 1134 states and 1522 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:41,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:41,261 INFO L93 Difference]: Finished difference Result 1512 states and 2078 transitions. [2023-12-22 02:29:41,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:41,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2023-12-22 02:29:41,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:41,264 INFO L225 Difference]: With dead ends: 1512 [2023-12-22 02:29:41,264 INFO L226 Difference]: Without dead ends: 1192 [2023-12-22 02:29:41,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:29:41,265 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 380 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:41,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 439 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2023-12-22 02:29:41,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2023-12-22 02:29:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1039 states have (on average 1.3310875842155918) internal successors, (1383), 1054 states have internal predecessors, (1383), 87 states have call successors, (87), 56 states have call predecessors, (87), 64 states have return successors, (119), 82 states have call predecessors, (119), 86 states have call successors, (119) [2023-12-22 02:29:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1589 transitions. [2023-12-22 02:29:41,323 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1589 transitions. Word has length 71 [2023-12-22 02:29:41,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:41,323 INFO L495 AbstractCegarLoop]: Abstraction has 1192 states and 1589 transitions. [2023-12-22 02:29:41,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:41,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1589 transitions. [2023-12-22 02:29:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:29:41,324 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:41,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:41,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:41,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:41,528 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:41,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:41,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1372459591, now seen corresponding path program 1 times [2023-12-22 02:29:41,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:41,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094726932] [2023-12-22 02:29:41,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:41,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:41,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:41,530 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:41,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-22 02:29:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:41,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:41,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:41,647 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:41,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:41,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094726932] [2023-12-22 02:29:41,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094726932] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:41,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:41,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:41,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541288372] [2023-12-22 02:29:41,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:41,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:41,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:41,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:41,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:41,649 INFO L87 Difference]: Start difference. First operand 1192 states and 1589 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:41,965 INFO L93 Difference]: Finished difference Result 1628 states and 2212 transitions. [2023-12-22 02:29:41,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:41,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2023-12-22 02:29:41,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:41,970 INFO L225 Difference]: With dead ends: 1628 [2023-12-22 02:29:41,970 INFO L226 Difference]: Without dead ends: 1250 [2023-12-22 02:29:41,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:29:41,973 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 374 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:41,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 432 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:41,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2023-12-22 02:29:42,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2023-12-22 02:29:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1091 states have (on average 1.3217231897341888) internal successors, (1442), 1106 states have internal predecessors, (1442), 89 states have call successors, (89), 60 states have call predecessors, (89), 68 states have return successors, (121), 84 states have call predecessors, (121), 88 states have call successors, (121) [2023-12-22 02:29:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1652 transitions. [2023-12-22 02:29:42,041 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1652 transitions. Word has length 71 [2023-12-22 02:29:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:42,042 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1652 transitions. [2023-12-22 02:29:42,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1652 transitions. [2023-12-22 02:29:42,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:29:42,043 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:42,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:42,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:42,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:42,247 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:42,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:42,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1252676492, now seen corresponding path program 1 times [2023-12-22 02:29:42,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:42,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437788411] [2023-12-22 02:29:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:42,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:42,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:42,249 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:42,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-22 02:29:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:42,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:42,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:42,344 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:42,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:42,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437788411] [2023-12-22 02:29:42,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437788411] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:42,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:42,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:42,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042290137] [2023-12-22 02:29:42,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:42,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:42,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:42,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:42,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:42,345 INFO L87 Difference]: Start difference. First operand 1250 states and 1652 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:42,673 INFO L93 Difference]: Finished difference Result 1738 states and 2330 transitions. [2023-12-22 02:29:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:42,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2023-12-22 02:29:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:42,677 INFO L225 Difference]: With dead ends: 1738 [2023-12-22 02:29:42,677 INFO L226 Difference]: Without dead ends: 1302 [2023-12-22 02:29:42,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:29:42,678 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 367 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:42,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 425 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:29:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2023-12-22 02:29:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2023-12-22 02:29:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1141 states have (on average 1.3102541630148992) internal successors, (1495), 1156 states have internal predecessors, (1495), 89 states have call successors, (89), 62 states have call predecessors, (89), 70 states have return successors, (121), 84 states have call predecessors, (121), 88 states have call successors, (121) [2023-12-22 02:29:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1705 transitions. [2023-12-22 02:29:42,750 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1705 transitions. Word has length 71 [2023-12-22 02:29:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:42,750 INFO L495 AbstractCegarLoop]: Abstraction has 1302 states and 1705 transitions. [2023-12-22 02:29:42,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1705 transitions. [2023-12-22 02:29:42,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:29:42,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:42,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:42,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:42,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:42,955 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:42,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:42,956 INFO L85 PathProgramCache]: Analyzing trace with hash 796871816, now seen corresponding path program 1 times [2023-12-22 02:29:42,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:42,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101394539] [2023-12-22 02:29:42,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:42,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:42,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:42,957 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:42,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-22 02:29:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:43,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:43,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:43,034 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:43,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:43,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101394539] [2023-12-22 02:29:43,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101394539] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:43,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:43,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:43,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051470796] [2023-12-22 02:29:43,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:43,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:43,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:43,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:43,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:43,036 INFO L87 Difference]: Start difference. First operand 1302 states and 1705 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:43,164 INFO L93 Difference]: Finished difference Result 1833 states and 2421 transitions. [2023-12-22 02:29:43,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:43,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2023-12-22 02:29:43,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:43,167 INFO L225 Difference]: With dead ends: 1833 [2023-12-22 02:29:43,167 INFO L226 Difference]: Without dead ends: 1346 [2023-12-22 02:29:43,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:43,169 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 29 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:43,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 751 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2023-12-22 02:29:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1306. [2023-12-22 02:29:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1145 states have (on average 1.3021834061135371) internal successors, (1491), 1160 states have internal predecessors, (1491), 89 states have call successors, (89), 62 states have call predecessors, (89), 70 states have return successors, (121), 84 states have call predecessors, (121), 88 states have call successors, (121) [2023-12-22 02:29:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1701 transitions. [2023-12-22 02:29:43,235 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1701 transitions. Word has length 71 [2023-12-22 02:29:43,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:43,235 INFO L495 AbstractCegarLoop]: Abstraction has 1306 states and 1701 transitions. [2023-12-22 02:29:43,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:43,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1701 transitions. [2023-12-22 02:29:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:29:43,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:43,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:43,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:43,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:43,441 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:43,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:43,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1252516026, now seen corresponding path program 1 times [2023-12-22 02:29:43,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:43,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010311709] [2023-12-22 02:29:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:43,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:43,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:43,443 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:43,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-22 02:29:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:43,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:43,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:43,515 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:43,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:43,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010311709] [2023-12-22 02:29:43,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010311709] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:43,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:43,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:43,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747260923] [2023-12-22 02:29:43,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:43,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:43,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:43,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:43,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:43,517 INFO L87 Difference]: Start difference. First operand 1306 states and 1701 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:43,655 INFO L93 Difference]: Finished difference Result 1829 states and 2397 transitions. [2023-12-22 02:29:43,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:43,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2023-12-22 02:29:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:43,659 INFO L225 Difference]: With dead ends: 1829 [2023-12-22 02:29:43,659 INFO L226 Difference]: Without dead ends: 1338 [2023-12-22 02:29:43,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:43,661 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 20 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:43,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 752 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2023-12-22 02:29:43,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1310. [2023-12-22 02:29:43,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1149 states have (on average 1.2941688424717146) internal successors, (1487), 1164 states have internal predecessors, (1487), 89 states have call successors, (89), 62 states have call predecessors, (89), 70 states have return successors, (121), 84 states have call predecessors, (121), 88 states have call successors, (121) [2023-12-22 02:29:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1697 transitions. [2023-12-22 02:29:43,728 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1697 transitions. Word has length 71 [2023-12-22 02:29:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:43,728 INFO L495 AbstractCegarLoop]: Abstraction has 1310 states and 1697 transitions. [2023-12-22 02:29:43,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:43,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1697 transitions. [2023-12-22 02:29:43,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:29:43,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:43,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:43,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-22 02:29:43,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:43,933 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:43,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:43,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1197084104, now seen corresponding path program 1 times [2023-12-22 02:29:43,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:43,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980176474] [2023-12-22 02:29:43,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:43,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:43,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:43,934 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:43,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-22 02:29:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:43,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:43,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:44,007 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:44,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:44,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980176474] [2023-12-22 02:29:44,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980176474] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:44,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:44,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:44,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491833096] [2023-12-22 02:29:44,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:44,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:44,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:44,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:44,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:44,008 INFO L87 Difference]: Start difference. First operand 1310 states and 1697 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:44,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:44,107 INFO L93 Difference]: Finished difference Result 1825 states and 2373 transitions. [2023-12-22 02:29:44,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:44,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2023-12-22 02:29:44,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:44,111 INFO L225 Difference]: With dead ends: 1825 [2023-12-22 02:29:44,111 INFO L226 Difference]: Without dead ends: 1330 [2023-12-22 02:29:44,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:44,113 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 11 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:44,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 753 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2023-12-22 02:29:44,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1314. [2023-12-22 02:29:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1153 states have (on average 1.2862098872506504) internal successors, (1483), 1168 states have internal predecessors, (1483), 89 states have call successors, (89), 62 states have call predecessors, (89), 70 states have return successors, (121), 84 states have call predecessors, (121), 88 states have call successors, (121) [2023-12-22 02:29:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1693 transitions. [2023-12-22 02:29:44,231 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1693 transitions. Word has length 71 [2023-12-22 02:29:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:44,232 INFO L495 AbstractCegarLoop]: Abstraction has 1314 states and 1693 transitions. [2023-12-22 02:29:44,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1693 transitions. [2023-12-22 02:29:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:29:44,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:44,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:44,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:44,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:44,437 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:44,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:44,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1046899194, now seen corresponding path program 1 times [2023-12-22 02:29:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:44,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492596123] [2023-12-22 02:29:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:44,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:44,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:44,439 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:44,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-22 02:29:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:44,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:44,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:44,517 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:44,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:44,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492596123] [2023-12-22 02:29:44,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492596123] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:44,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:44,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:44,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309987690] [2023-12-22 02:29:44,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:44,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:44,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:44,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:44,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:44,519 INFO L87 Difference]: Start difference. First operand 1314 states and 1693 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:44,621 INFO L93 Difference]: Finished difference Result 1821 states and 2349 transitions. [2023-12-22 02:29:44,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:44,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2023-12-22 02:29:44,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:44,624 INFO L225 Difference]: With dead ends: 1821 [2023-12-22 02:29:44,624 INFO L226 Difference]: Without dead ends: 1322 [2023-12-22 02:29:44,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:44,626 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 2 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:44,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 754 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:44,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2023-12-22 02:29:44,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1318. [2023-12-22 02:29:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1157 states have (on average 1.2783059636992222) internal successors, (1479), 1172 states have internal predecessors, (1479), 89 states have call successors, (89), 62 states have call predecessors, (89), 70 states have return successors, (121), 84 states have call predecessors, (121), 88 states have call successors, (121) [2023-12-22 02:29:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1689 transitions. [2023-12-22 02:29:44,721 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1689 transitions. Word has length 71 [2023-12-22 02:29:44,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:44,721 INFO L495 AbstractCegarLoop]: Abstraction has 1318 states and 1689 transitions. [2023-12-22 02:29:44,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1689 transitions. [2023-12-22 02:29:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:29:44,722 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:44,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:44,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:44,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:44,926 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:44,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:44,926 INFO L85 PathProgramCache]: Analyzing trace with hash 339304200, now seen corresponding path program 1 times [2023-12-22 02:29:44,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:44,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053305183] [2023-12-22 02:29:44,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:44,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:44,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:44,928 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:44,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-22 02:29:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:44,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-22 02:29:44,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:45,063 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:45,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053305183] [2023-12-22 02:29:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053305183] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:45,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:45,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:45,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258462391] [2023-12-22 02:29:45,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:45,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:45,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:45,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:45,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:45,065 INFO L87 Difference]: Start difference. First operand 1318 states and 1689 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:45,340 INFO L93 Difference]: Finished difference Result 1822 states and 2320 transitions. [2023-12-22 02:29:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:45,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2023-12-22 02:29:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:45,349 INFO L225 Difference]: With dead ends: 1822 [2023-12-22 02:29:45,349 INFO L226 Difference]: Without dead ends: 1318 [2023-12-22 02:29:45,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:29:45,350 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 305 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:45,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 417 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2023-12-22 02:29:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1318. [2023-12-22 02:29:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1157 states have (on average 1.2722558340535868) internal successors, (1472), 1172 states have internal predecessors, (1472), 89 states have call successors, (89), 62 states have call predecessors, (89), 70 states have return successors, (121), 84 states have call predecessors, (121), 88 states have call successors, (121) [2023-12-22 02:29:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1682 transitions. [2023-12-22 02:29:45,420 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1682 transitions. Word has length 71 [2023-12-22 02:29:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:45,420 INFO L495 AbstractCegarLoop]: Abstraction has 1318 states and 1682 transitions. [2023-12-22 02:29:45,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-12-22 02:29:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1682 transitions. [2023-12-22 02:29:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:29:45,422 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:45,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:45,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:45,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:45,626 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:45,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1466134134, now seen corresponding path program 1 times [2023-12-22 02:29:45,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:45,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129706697] [2023-12-22 02:29:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:45,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:45,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:45,628 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:45,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-22 02:29:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:45,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:45,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:45,755 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:45,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:45,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129706697] [2023-12-22 02:29:45,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129706697] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:45,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:45,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:29:45,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278408929] [2023-12-22 02:29:45,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:45,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:45,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:45,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:45,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:45,757 INFO L87 Difference]: Start difference. First operand 1318 states and 1682 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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) [2023-12-22 02:29:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:45,907 INFO L93 Difference]: Finished difference Result 2301 states and 2901 transitions. [2023-12-22 02:29:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:45,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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 71 [2023-12-22 02:29:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:45,911 INFO L225 Difference]: With dead ends: 2301 [2023-12-22 02:29:45,912 INFO L226 Difference]: Without dead ends: 1798 [2023-12-22 02:29:45,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:45,914 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 196 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:45,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 434 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:45,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2023-12-22 02:29:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1796. [2023-12-22 02:29:46,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1577 states have (on average 1.2549143944197845) internal successors, (1979), 1595 states have internal predecessors, (1979), 120 states have call successors, (120), 88 states have call predecessors, (120), 97 states have return successors, (153), 113 states have call predecessors, (153), 119 states have call successors, (153) [2023-12-22 02:29:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2252 transitions. [2023-12-22 02:29:46,005 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2252 transitions. Word has length 71 [2023-12-22 02:29:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:46,005 INFO L495 AbstractCegarLoop]: Abstraction has 1796 states and 2252 transitions. [2023-12-22 02:29:46,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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) [2023-12-22 02:29:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2252 transitions. [2023-12-22 02:29:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-22 02:29:46,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:46,007 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:46,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:46,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:46,211 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:46,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2128868807, now seen corresponding path program 2 times [2023-12-22 02:29:46,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:46,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617350032] [2023-12-22 02:29:46,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 02:29:46,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:46,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:46,213 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:46,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-22 02:29:46,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-22 02:29:46,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 02:29:46,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:46,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-22 02:29:46,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:46,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:46,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617350032] [2023-12-22 02:29:46,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617350032] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:46,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:46,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:46,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742032343] [2023-12-22 02:29:46,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:46,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:46,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:46,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:46,327 INFO L87 Difference]: Start difference. First operand 1796 states and 2252 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2023-12-22 02:29:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:46,434 INFO L93 Difference]: Finished difference Result 2351 states and 2983 transitions. [2023-12-22 02:29:46,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:46,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 78 [2023-12-22 02:29:46,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:46,439 INFO L225 Difference]: With dead ends: 2351 [2023-12-22 02:29:46,439 INFO L226 Difference]: Without dead ends: 1700 [2023-12-22 02:29:46,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:46,441 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 241 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:46,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 342 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2023-12-22 02:29:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1688. [2023-12-22 02:29:46,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1688 states, 1482 states have (on average 1.2489878542510122) internal successors, (1851), 1500 states have internal predecessors, (1851), 113 states have call successors, (113), 83 states have call predecessors, (113), 91 states have return successors, (142), 105 states have call predecessors, (142), 112 states have call successors, (142) [2023-12-22 02:29:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2106 transitions. [2023-12-22 02:29:46,533 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2106 transitions. Word has length 78 [2023-12-22 02:29:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:46,533 INFO L495 AbstractCegarLoop]: Abstraction has 1688 states and 2106 transitions. [2023-12-22 02:29:46,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2023-12-22 02:29:46,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2106 transitions. [2023-12-22 02:29:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-22 02:29:46,536 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:46,536 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:46,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:46,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:46,739 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:46,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:46,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2130319401, now seen corresponding path program 1 times [2023-12-22 02:29:46,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:46,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452211801] [2023-12-22 02:29:46,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:46,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:46,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:46,741 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:46,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-22 02:29:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:46,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:46,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-22 02:29:46,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:46,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:46,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452211801] [2023-12-22 02:29:46,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452211801] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:46,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:46,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:46,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227795770] [2023-12-22 02:29:46,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:46,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:46,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:46,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:46,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:46,898 INFO L87 Difference]: Start difference. First operand 1688 states and 2106 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2023-12-22 02:29:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:47,225 INFO L93 Difference]: Finished difference Result 2412 states and 3047 transitions. [2023-12-22 02:29:47,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:47,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 92 [2023-12-22 02:29:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:47,231 INFO L225 Difference]: With dead ends: 2412 [2023-12-22 02:29:47,231 INFO L226 Difference]: Without dead ends: 1721 [2023-12-22 02:29:47,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:47,234 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 310 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:47,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 352 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2023-12-22 02:29:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1688. [2023-12-22 02:29:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1688 states, 1482 states have (on average 1.2388663967611335) internal successors, (1836), 1500 states have internal predecessors, (1836), 113 states have call successors, (113), 83 states have call predecessors, (113), 91 states have return successors, (141), 105 states have call predecessors, (141), 112 states have call successors, (141) [2023-12-22 02:29:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2090 transitions. [2023-12-22 02:29:47,350 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2090 transitions. Word has length 92 [2023-12-22 02:29:47,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:47,350 INFO L495 AbstractCegarLoop]: Abstraction has 1688 states and 2090 transitions. [2023-12-22 02:29:47,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2023-12-22 02:29:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2090 transitions. [2023-12-22 02:29:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-22 02:29:47,352 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:47,352 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:47,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:47,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:47,557 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:47,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:47,558 INFO L85 PathProgramCache]: Analyzing trace with hash -435820186, now seen corresponding path program 1 times [2023-12-22 02:29:47,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:47,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137742443] [2023-12-22 02:29:47,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:47,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:47,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:47,559 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:47,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-22 02:29:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:47,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:47,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-22 02:29:47,647 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:47,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:47,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137742443] [2023-12-22 02:29:47,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137742443] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:47,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:47,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:47,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662683120] [2023-12-22 02:29:47,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:47,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:47,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:47,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:47,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:47,648 INFO L87 Difference]: Start difference. First operand 1688 states and 2090 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2023-12-22 02:29:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:47,769 INFO L93 Difference]: Finished difference Result 1971 states and 2441 transitions. [2023-12-22 02:29:47,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:47,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 93 [2023-12-22 02:29:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:47,772 INFO L225 Difference]: With dead ends: 1971 [2023-12-22 02:29:47,772 INFO L226 Difference]: Without dead ends: 992 [2023-12-22 02:29:47,773 INFO L412 NwaCegarLoop]: 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 [2023-12-22 02:29:47,774 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 54 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:47,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 518 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2023-12-22 02:29:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2023-12-22 02:29:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 871 states have (on average 1.227324913892078) internal successors, (1069), 876 states have internal predecessors, (1069), 66 states have call successors, (66), 52 states have call predecessors, (66), 54 states have return successors, (68), 64 states have call predecessors, (68), 66 states have call successors, (68) [2023-12-22 02:29:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1203 transitions. [2023-12-22 02:29:47,818 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1203 transitions. Word has length 93 [2023-12-22 02:29:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:47,818 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1203 transitions. [2023-12-22 02:29:47,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2023-12-22 02:29:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1203 transitions. [2023-12-22 02:29:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-22 02:29:47,819 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:47,819 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-22 02:29:47,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-12-22 02:29:48,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:48,022 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:48,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:48,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1971541664, now seen corresponding path program 1 times [2023-12-22 02:29:48,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:48,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868994677] [2023-12-22 02:29:48,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:48,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:48,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:48,024 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:48,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-22 02:29:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:48,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-22 02:29:48,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-22 02:29:48,232 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:48,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:48,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868994677] [2023-12-22 02:29:48,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868994677] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:48,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:48,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:48,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459647069] [2023-12-22 02:29:48,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:48,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:48,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:48,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:48,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:48,234 INFO L87 Difference]: Start difference. First operand 992 states and 1203 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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) [2023-12-22 02:29:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:48,492 INFO L93 Difference]: Finished difference Result 2864 states and 3476 transitions. [2023-12-22 02:29:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:48,493 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), 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 115 [2023-12-22 02:29:48,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:48,497 INFO L225 Difference]: With dead ends: 2864 [2023-12-22 02:29:48,497 INFO L226 Difference]: Without dead ends: 1884 [2023-12-22 02:29:48,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:48,499 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 213 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:48,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 448 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2023-12-22 02:29:48,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1882. [2023-12-22 02:29:48,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1650 states have (on average 1.2133333333333334) internal successors, (2002), 1664 states have internal predecessors, (2002), 123 states have call successors, (123), 96 states have call predecessors, (123), 108 states have return successors, (147), 123 states have call predecessors, (147), 123 states have call successors, (147) [2023-12-22 02:29:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2272 transitions. [2023-12-22 02:29:48,643 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2272 transitions. Word has length 115 [2023-12-22 02:29:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:48,643 INFO L495 AbstractCegarLoop]: Abstraction has 1882 states and 2272 transitions. [2023-12-22 02:29:48,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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) [2023-12-22 02:29:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2272 transitions. [2023-12-22 02:29:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-22 02:29:48,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:48,645 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-22 02:29:48,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:48,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:48,848 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:48,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:48,849 INFO L85 PathProgramCache]: Analyzing trace with hash 350260254, now seen corresponding path program 1 times [2023-12-22 02:29:48,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:48,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002085321] [2023-12-22 02:29:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:48,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:48,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:48,850 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:48,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-22 02:29:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:48,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:48,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-22 02:29:48,930 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:48,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:48,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002085321] [2023-12-22 02:29:48,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002085321] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:48,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:48,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:48,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147937136] [2023-12-22 02:29:48,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:48,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:48,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:48,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:48,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:48,931 INFO L87 Difference]: Start difference. First operand 1882 states and 2272 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2023-12-22 02:29:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:49,028 INFO L93 Difference]: Finished difference Result 3746 states and 4513 transitions. [2023-12-22 02:29:49,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:49,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 115 [2023-12-22 02:29:49,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:49,033 INFO L225 Difference]: With dead ends: 3746 [2023-12-22 02:29:49,033 INFO L226 Difference]: Without dead ends: 1876 [2023-12-22 02:29:49,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:49,036 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 185 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:49,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 174 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:49,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2023-12-22 02:29:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1876. [2023-12-22 02:29:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1647 states have (on average 1.211900425015179) internal successors, (1996), 1660 states have internal predecessors, (1996), 120 states have call successors, (120), 96 states have call predecessors, (120), 108 states have return successors, (144), 120 states have call predecessors, (144), 120 states have call successors, (144) [2023-12-22 02:29:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2260 transitions. [2023-12-22 02:29:49,124 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2260 transitions. Word has length 115 [2023-12-22 02:29:49,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:49,124 INFO L495 AbstractCegarLoop]: Abstraction has 1876 states and 2260 transitions. [2023-12-22 02:29:49,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2023-12-22 02:29:49,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2260 transitions. [2023-12-22 02:29:49,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-22 02:29:49,125 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:49,125 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-22 02:29:49,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:49,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:49,329 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:49,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:49,329 INFO L85 PathProgramCache]: Analyzing trace with hash 874382843, now seen corresponding path program 1 times [2023-12-22 02:29:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:49,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018475391] [2023-12-22 02:29:49,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:49,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:49,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:49,331 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:49,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-22 02:29:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:49,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-22 02:29:49,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-22 02:29:49,523 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:49,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:49,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018475391] [2023-12-22 02:29:49,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018475391] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:49,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:49,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:49,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684886843] [2023-12-22 02:29:49,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:49,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:49,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:49,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:49,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:49,525 INFO L87 Difference]: Start difference. First operand 1876 states and 2260 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2023-12-22 02:29:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:49,915 INFO L93 Difference]: Finished difference Result 5345 states and 6443 transitions. [2023-12-22 02:29:49,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:49,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 117 [2023-12-22 02:29:49,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:49,923 INFO L225 Difference]: With dead ends: 5345 [2023-12-22 02:29:49,923 INFO L226 Difference]: Without dead ends: 3481 [2023-12-22 02:29:49,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:49,927 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 208 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:49,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 413 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:49,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3481 states. [2023-12-22 02:29:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3481 to 3479. [2023-12-22 02:29:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3479 states, 3047 states have (on average 1.2021660649819494) internal successors, (3663), 3077 states have internal predecessors, (3663), 223 states have call successors, (223), 176 states have call predecessors, (223), 208 states have return successors, (291), 227 states have call predecessors, (291), 223 states have call successors, (291) [2023-12-22 02:29:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 3479 states and 4177 transitions. [2023-12-22 02:29:50,180 INFO L78 Accepts]: Start accepts. Automaton has 3479 states and 4177 transitions. Word has length 117 [2023-12-22 02:29:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:50,180 INFO L495 AbstractCegarLoop]: Abstraction has 3479 states and 4177 transitions. [2023-12-22 02:29:50,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2023-12-22 02:29:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 4177 transitions. [2023-12-22 02:29:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-22 02:29:50,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:50,182 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-22 02:29:50,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:50,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:50,386 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:50,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:50,386 INFO L85 PathProgramCache]: Analyzing trace with hash -164201731, now seen corresponding path program 1 times [2023-12-22 02:29:50,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:50,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27547687] [2023-12-22 02:29:50,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:50,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:50,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:50,388 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:50,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-22 02:29:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:50,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:50,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-22 02:29:50,518 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:50,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:50,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27547687] [2023-12-22 02:29:50,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27547687] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:50,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:50,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:50,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149960421] [2023-12-22 02:29:50,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:50,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:50,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:50,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:50,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:50,519 INFO L87 Difference]: Start difference. First operand 3479 states and 4177 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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) [2023-12-22 02:29:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:50,772 INFO L93 Difference]: Finished difference Result 6941 states and 8326 transitions. [2023-12-22 02:29:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:50,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 117 [2023-12-22 02:29:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:50,786 INFO L225 Difference]: With dead ends: 6941 [2023-12-22 02:29:50,787 INFO L226 Difference]: Without dead ends: 3474 [2023-12-22 02:29:50,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:50,795 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:50,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 173 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2023-12-22 02:29:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3474. [2023-12-22 02:29:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3474 states, 3045 states have (on average 1.2016420361247948) internal successors, (3659), 3074 states have internal predecessors, (3659), 220 states have call successors, (220), 176 states have call predecessors, (220), 208 states have return successors, (288), 224 states have call predecessors, (288), 220 states have call successors, (288) [2023-12-22 02:29:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 4167 transitions. [2023-12-22 02:29:51,067 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 4167 transitions. Word has length 117 [2023-12-22 02:29:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:51,067 INFO L495 AbstractCegarLoop]: Abstraction has 3474 states and 4167 transitions. [2023-12-22 02:29:51,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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) [2023-12-22 02:29:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 4167 transitions. [2023-12-22 02:29:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-22 02:29:51,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:51,071 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:51,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:51,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:51,276 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:51,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:51,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1670418528, now seen corresponding path program 1 times [2023-12-22 02:29:51,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:51,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467273092] [2023-12-22 02:29:51,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:51,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:51,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:51,278 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:51,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-22 02:29:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:51,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-22 02:29:51,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-22 02:29:51,478 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:51,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:51,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467273092] [2023-12-22 02:29:51,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467273092] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:51,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:51,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:51,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379117277] [2023-12-22 02:29:51,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:51,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:51,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:51,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:51,479 INFO L87 Difference]: Start difference. First operand 3474 states and 4167 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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) [2023-12-22 02:29:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:52,097 INFO L93 Difference]: Finished difference Result 9850 states and 11824 transitions. [2023-12-22 02:29:52,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:52,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 119 [2023-12-22 02:29:52,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:52,114 INFO L225 Difference]: With dead ends: 9850 [2023-12-22 02:29:52,114 INFO L226 Difference]: Without dead ends: 6388 [2023-12-22 02:29:52,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:52,121 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 200 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:52,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 380 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6388 states. [2023-12-22 02:29:52,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6388 to 6386. [2023-12-22 02:29:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6386 states, 5578 states have (on average 1.194693438508426) internal successors, (6664), 5644 states have internal predecessors, (6664), 407 states have call successors, (407), 320 states have call predecessors, (407), 400 states have return successors, (571), 423 states have call predecessors, (571), 407 states have call successors, (571) [2023-12-22 02:29:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6386 states to 6386 states and 7642 transitions. [2023-12-22 02:29:52,522 INFO L78 Accepts]: Start accepts. Automaton has 6386 states and 7642 transitions. Word has length 119 [2023-12-22 02:29:52,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:52,522 INFO L495 AbstractCegarLoop]: Abstraction has 6386 states and 7642 transitions. [2023-12-22 02:29:52,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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) [2023-12-22 02:29:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 6386 states and 7642 transitions. [2023-12-22 02:29:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-22 02:29:52,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:52,527 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:52,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:52,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:52,731 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:52,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:52,731 INFO L85 PathProgramCache]: Analyzing trace with hash 493198046, now seen corresponding path program 1 times [2023-12-22 02:29:52,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:52,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229998651] [2023-12-22 02:29:52,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:52,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:52,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:52,733 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:52,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-22 02:29:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:52,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:52,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-22 02:29:52,878 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:52,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:52,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229998651] [2023-12-22 02:29:52,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229998651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:52,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:52,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:52,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954511129] [2023-12-22 02:29:52,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:52,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:52,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:52,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:52,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:52,879 INFO L87 Difference]: Start difference. First operand 6386 states and 7642 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2023-12-22 02:29:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:53,274 INFO L93 Difference]: Finished difference Result 12756 states and 15259 transitions. [2023-12-22 02:29:53,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:53,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 119 [2023-12-22 02:29:53,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:53,327 INFO L225 Difference]: With dead ends: 12756 [2023-12-22 02:29:53,328 INFO L226 Difference]: Without dead ends: 6382 [2023-12-22 02:29:53,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:53,335 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:53,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 172 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6382 states. [2023-12-22 02:29:53,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6382 to 6382. [2023-12-22 02:29:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6382 states, 5577 states have (on average 1.194549040702887) internal successors, (6662), 5642 states have internal predecessors, (6662), 404 states have call successors, (404), 320 states have call predecessors, (404), 400 states have return successors, (568), 420 states have call predecessors, (568), 404 states have call successors, (568) [2023-12-22 02:29:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6382 states to 6382 states and 7634 transitions. [2023-12-22 02:29:53,707 INFO L78 Accepts]: Start accepts. Automaton has 6382 states and 7634 transitions. Word has length 119 [2023-12-22 02:29:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:53,707 INFO L495 AbstractCegarLoop]: Abstraction has 6382 states and 7634 transitions. [2023-12-22 02:29:53,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2023-12-22 02:29:53,708 INFO L276 IsEmpty]: Start isEmpty. Operand 6382 states and 7634 transitions. [2023-12-22 02:29:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-22 02:29:53,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:53,710 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:53,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:53,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:53,914 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:53,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:53,914 INFO L85 PathProgramCache]: Analyzing trace with hash 440081147, now seen corresponding path program 1 times [2023-12-22 02:29:53,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:53,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368498908] [2023-12-22 02:29:53,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:53,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:53,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:53,916 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:53,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-22 02:29:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:53,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:53,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:54,019 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-22 02:29:54,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:54,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:54,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368498908] [2023-12-22 02:29:54,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368498908] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:54,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:54,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:54,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564981177] [2023-12-22 02:29:54,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:54,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:54,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:54,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:54,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:54,020 INFO L87 Difference]: Start difference. First operand 6382 states and 7634 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2023-12-22 02:29:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:54,707 INFO L93 Difference]: Finished difference Result 17687 states and 21261 transitions. [2023-12-22 02:29:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:54,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 121 [2023-12-22 02:29:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:54,724 INFO L225 Difference]: With dead ends: 17687 [2023-12-22 02:29:54,724 INFO L226 Difference]: Without dead ends: 8882 [2023-12-22 02:29:54,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:54,733 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 147 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:54,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 480 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8882 states. [2023-12-22 02:29:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8882 to 8882. [2023-12-22 02:29:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8882 states, 7757 states have (on average 1.1905375789609385) internal successors, (9235), 7838 states have internal predecessors, (9235), 572 states have call successors, (572), 448 states have call predecessors, (572), 552 states have return successors, (818), 596 states have call predecessors, (818), 572 states have call successors, (818) [2023-12-22 02:29:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8882 states to 8882 states and 10625 transitions. [2023-12-22 02:29:55,421 INFO L78 Accepts]: Start accepts. Automaton has 8882 states and 10625 transitions. Word has length 121 [2023-12-22 02:29:55,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:55,422 INFO L495 AbstractCegarLoop]: Abstraction has 8882 states and 10625 transitions. [2023-12-22 02:29:55,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2023-12-22 02:29:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 8882 states and 10625 transitions. [2023-12-22 02:29:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-22 02:29:55,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:55,427 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:55,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:55,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:55,630 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:55,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:55,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1902062052, now seen corresponding path program 1 times [2023-12-22 02:29:55,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:55,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140890805] [2023-12-22 02:29:55,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:55,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:55,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:55,633 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:55,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-12-22 02:29:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:55,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:55,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-22 02:29:55,830 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:55,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:55,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140890805] [2023-12-22 02:29:55,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140890805] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:55,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:55,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:29:55,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138941141] [2023-12-22 02:29:55,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:55,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:55,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:55,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:55,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:55,831 INFO L87 Difference]: Start difference. First operand 8882 states and 10625 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-22 02:29:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:56,491 INFO L93 Difference]: Finished difference Result 20261 states and 24293 transitions. [2023-12-22 02:29:56,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:56,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 152 [2023-12-22 02:29:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:56,517 INFO L225 Difference]: With dead ends: 20261 [2023-12-22 02:29:56,517 INFO L226 Difference]: Without dead ends: 11390 [2023-12-22 02:29:56,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:56,529 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 82 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:56,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 325 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:56,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11390 states. [2023-12-22 02:29:57,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11390 to 11366. [2023-12-22 02:29:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11366 states, 9921 states have (on average 1.1812317306723112) internal successors, (11719), 10018 states have internal predecessors, (11719), 740 states have call successors, (740), 576 states have call predecessors, (740), 704 states have return successors, (1046), 772 states have call predecessors, (1046), 740 states have call successors, (1046) [2023-12-22 02:29:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11366 states to 11366 states and 13505 transitions. [2023-12-22 02:29:57,196 INFO L78 Accepts]: Start accepts. Automaton has 11366 states and 13505 transitions. Word has length 152 [2023-12-22 02:29:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:57,196 INFO L495 AbstractCegarLoop]: Abstraction has 11366 states and 13505 transitions. [2023-12-22 02:29:57,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-22 02:29:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 11366 states and 13505 transitions. [2023-12-22 02:29:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-22 02:29:57,203 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:57,203 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:57,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:57,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:57,407 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:57,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:57,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1846067200, now seen corresponding path program 1 times [2023-12-22 02:29:57,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:57,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189406480] [2023-12-22 02:29:57,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:57,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:57,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:57,409 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:57,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-12-22 02:29:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:57,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:57,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-22 02:29:57,630 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:57,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:57,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189406480] [2023-12-22 02:29:57,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189406480] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:57,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:57,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:57,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428094591] [2023-12-22 02:29:57,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:57,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:57,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:57,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:57,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:57,631 INFO L87 Difference]: Start difference. First operand 11366 states and 13505 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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) [2023-12-22 02:29:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:58,687 INFO L93 Difference]: Finished difference Result 22826 states and 27194 transitions. [2023-12-22 02:29:58,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:58,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 173 [2023-12-22 02:29:58,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:58,710 INFO L225 Difference]: With dead ends: 22826 [2023-12-22 02:29:58,710 INFO L226 Difference]: Without dead ends: 11472 [2023-12-22 02:29:58,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:58,726 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 217 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:58,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 330 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:58,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11472 states. [2023-12-22 02:29:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11472 to 11472. [2023-12-22 02:29:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11472 states, 10011 states have (on average 1.170612326440915) internal successors, (11719), 10116 states have internal predecessors, (11719), 740 states have call successors, (740), 576 states have call predecessors, (740), 720 states have return successors, (944), 780 states have call predecessors, (944), 740 states have call successors, (944) [2023-12-22 02:29:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 13403 transitions. [2023-12-22 02:29:59,491 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 13403 transitions. Word has length 173 [2023-12-22 02:29:59,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:59,491 INFO L495 AbstractCegarLoop]: Abstraction has 11472 states and 13403 transitions. [2023-12-22 02:29:59,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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) [2023-12-22 02:29:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 13403 transitions. [2023-12-22 02:29:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-12-22 02:29:59,498 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:59,498 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:59,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:59,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:59,702 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:59,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:59,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1226506176, now seen corresponding path program 1 times [2023-12-22 02:29:59,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:59,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065494317] [2023-12-22 02:29:59,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:59,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:59,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:59,704 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:59,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-12-22 02:29:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:59,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:59,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-22 02:29:59,814 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:59,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:59,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065494317] [2023-12-22 02:29:59,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065494317] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:59,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:59,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:59,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395251352] [2023-12-22 02:29:59,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:59,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:59,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:59,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:59,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:59,815 INFO L87 Difference]: Start difference. First operand 11472 states and 13403 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-22 02:30:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:30:00,520 INFO L93 Difference]: Finished difference Result 20464 states and 23965 transitions. [2023-12-22 02:30:00,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:30:00,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 174 [2023-12-22 02:30:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:30:00,541 INFO L225 Difference]: With dead ends: 20464 [2023-12-22 02:30:00,542 INFO L226 Difference]: Without dead ends: 11474 [2023-12-22 02:30:00,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:00,554 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 140 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:30:00,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 469 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:30:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11474 states. [2023-12-22 02:30:01,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11474 to 11472. [2023-12-22 02:30:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11472 states, 10011 states have (on average 1.1680151832983718) internal successors, (11693), 10116 states have internal predecessors, (11693), 740 states have call successors, (740), 576 states have call predecessors, (740), 720 states have return successors, (938), 780 states have call predecessors, (938), 740 states have call successors, (938) [2023-12-22 02:30:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 13371 transitions. [2023-12-22 02:30:01,271 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 13371 transitions. Word has length 174 [2023-12-22 02:30:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:30:01,272 INFO L495 AbstractCegarLoop]: Abstraction has 11472 states and 13371 transitions. [2023-12-22 02:30:01,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-22 02:30:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 13371 transitions. [2023-12-22 02:30:01,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-22 02:30:01,279 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:30:01,279 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:30:01,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2023-12-22 02:30:01,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:01,483 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:30:01,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:30:01,483 INFO L85 PathProgramCache]: Analyzing trace with hash -791261518, now seen corresponding path program 1 times [2023-12-22 02:30:01,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:30:01,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622132036] [2023-12-22 02:30:01,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:30:01,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:01,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:30:01,485 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:30:01,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-12-22 02:30:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:30:01,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:30:01,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:30:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-12-22 02:30:01,737 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:30:01,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:30:01,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622132036] [2023-12-22 02:30:01,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622132036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:30:01,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:30:01,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:30:01,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508579793] [2023-12-22 02:30:01,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:30:01,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:30:01,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:30:01,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:30:01,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:01,739 INFO L87 Difference]: Start difference. First operand 11472 states and 13371 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-22 02:30:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:30:02,587 INFO L93 Difference]: Finished difference Result 25119 states and 29301 transitions. [2023-12-22 02:30:02,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:30:02,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 205 [2023-12-22 02:30:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:30:02,614 INFO L225 Difference]: With dead ends: 25119 [2023-12-22 02:30:02,614 INFO L226 Difference]: Without dead ends: 13658 [2023-12-22 02:30:02,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:02,631 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 64 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:30:02,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 323 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:30:02,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13658 states. [2023-12-22 02:30:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13658 to 13626. [2023-12-22 02:30:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13626 states, 11885 states have (on average 1.1598653765250315) internal successors, (13785), 12002 states have internal predecessors, (13785), 892 states have call successors, (892), 688 states have call predecessors, (892), 848 states have return successors, (1118), 936 states have call predecessors, (1118), 892 states have call successors, (1118) [2023-12-22 02:30:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13626 states to 13626 states and 15795 transitions. [2023-12-22 02:30:03,690 INFO L78 Accepts]: Start accepts. Automaton has 13626 states and 15795 transitions. Word has length 205 [2023-12-22 02:30:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:30:03,691 INFO L495 AbstractCegarLoop]: Abstraction has 13626 states and 15795 transitions. [2023-12-22 02:30:03,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-22 02:30:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states and 15795 transitions. [2023-12-22 02:30:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-12-22 02:30:03,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:30:03,700 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:30:03,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2023-12-22 02:30:03,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:03,905 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:30:03,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:30:03,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1169315425, now seen corresponding path program 1 times [2023-12-22 02:30:03,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:30:03,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652709639] [2023-12-22 02:30:03,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:30:03,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:03,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:30:03,907 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:30:03,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-12-22 02:30:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:30:04,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:30:04,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:30:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-22 02:30:04,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:30:04,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:30:04,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652709639] [2023-12-22 02:30:04,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652709639] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:30:04,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:30:04,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:30:04,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680579109] [2023-12-22 02:30:04,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:30:04,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:30:04,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:30:04,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:30:04,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:04,046 INFO L87 Difference]: Start difference. First operand 13626 states and 15795 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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) [2023-12-22 02:30:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:30:04,871 INFO L93 Difference]: Finished difference Result 25088 states and 29151 transitions. [2023-12-22 02:30:04,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:30:04,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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 208 [2023-12-22 02:30:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:30:04,899 INFO L225 Difference]: With dead ends: 25088 [2023-12-22 02:30:04,899 INFO L226 Difference]: Without dead ends: 13628 [2023-12-22 02:30:04,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:04,916 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 137 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:30:04,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 459 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:30:04,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13628 states. [2023-12-22 02:30:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13628 to 13626. [2023-12-22 02:30:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13626 states, 11885 states have (on average 1.156668068994531) internal successors, (13747), 12002 states have internal predecessors, (13747), 892 states have call successors, (892), 688 states have call predecessors, (892), 848 states have return successors, (1100), 936 states have call predecessors, (1100), 892 states have call successors, (1100) [2023-12-22 02:30:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13626 states to 13626 states and 15739 transitions. [2023-12-22 02:30:05,757 INFO L78 Accepts]: Start accepts. Automaton has 13626 states and 15739 transitions. Word has length 208 [2023-12-22 02:30:05,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:30:05,757 INFO L495 AbstractCegarLoop]: Abstraction has 13626 states and 15739 transitions. [2023-12-22 02:30:05,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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) [2023-12-22 02:30:05,757 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states and 15739 transitions. [2023-12-22 02:30:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-22 02:30:05,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:30:05,767 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:30:05,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2023-12-22 02:30:05,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:05,972 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:30:05,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:30:05,972 INFO L85 PathProgramCache]: Analyzing trace with hash 397152572, now seen corresponding path program 1 times [2023-12-22 02:30:05,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:30:05,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725654379] [2023-12-22 02:30:05,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:30:05,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:05,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:30:05,980 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:30:05,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-12-22 02:30:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:30:06,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:30:06,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:30:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-12-22 02:30:06,244 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:30:06,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:30:06,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725654379] [2023-12-22 02:30:06,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725654379] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:30:06,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:30:06,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:30:06,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205366548] [2023-12-22 02:30:06,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:30:06,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:30:06,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:30:06,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:30:06,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:06,247 INFO L87 Difference]: Start difference. First operand 13626 states and 15739 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-22 02:30:07,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:30:07,305 INFO L93 Difference]: Finished difference Result 29105 states and 33593 transitions. [2023-12-22 02:30:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:30:07,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 239 [2023-12-22 02:30:07,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:30:07,330 INFO L225 Difference]: With dead ends: 29105 [2023-12-22 02:30:07,330 INFO L226 Difference]: Without dead ends: 15490 [2023-12-22 02:30:07,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:07,346 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 51 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:30:07,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 359 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:30:07,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15490 states. [2023-12-22 02:30:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15490 to 15450. [2023-12-22 02:30:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15450 states, 13469 states have (on average 1.148934590541243) internal successors, (15475), 13594 states have internal predecessors, (15475), 1028 states have call successors, (1028), 784 states have call predecessors, (1028), 952 states have return successors, (1244), 1072 states have call predecessors, (1244), 1028 states have call successors, (1244) [2023-12-22 02:30:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15450 states to 15450 states and 17747 transitions. [2023-12-22 02:30:08,408 INFO L78 Accepts]: Start accepts. Automaton has 15450 states and 17747 transitions. Word has length 239 [2023-12-22 02:30:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:30:08,408 INFO L495 AbstractCegarLoop]: Abstraction has 15450 states and 17747 transitions. [2023-12-22 02:30:08,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-22 02:30:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 15450 states and 17747 transitions. [2023-12-22 02:30:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2023-12-22 02:30:08,423 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:30:08,423 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:30:08,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2023-12-22 02:30:08,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:08,628 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:30:08,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:30:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1896356602, now seen corresponding path program 1 times [2023-12-22 02:30:08,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:30:08,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552159464] [2023-12-22 02:30:08,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:30:08,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:08,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:30:08,630 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:30:08,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-12-22 02:30:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:30:08,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:30:08,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:30:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-22 02:30:08,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:30:08,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:30:08,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552159464] [2023-12-22 02:30:08,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552159464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:30:08,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:30:08,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:30:08,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738277698] [2023-12-22 02:30:08,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:30:08,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:30:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:30:08,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:30:08,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:08,784 INFO L87 Difference]: Start difference. First operand 15450 states and 17747 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:30:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:30:09,294 INFO L93 Difference]: Finished difference Result 19710 states and 22614 transitions. [2023-12-22 02:30:09,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:30:09,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 242 [2023-12-22 02:30:09,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:30:09,303 INFO L225 Difference]: With dead ends: 19710 [2023-12-22 02:30:09,303 INFO L226 Difference]: Without dead ends: 3734 [2023-12-22 02:30:09,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:09,318 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 135 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:30:09,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 392 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:30:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2023-12-22 02:30:09,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3734. [2023-12-22 02:30:09,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3241 states have (on average 1.097500771366862) internal successors, (3557), 3260 states have internal predecessors, (3557), 280 states have call successors, (280), 196 states have call predecessors, (280), 212 states have return successors, (296), 278 states have call predecessors, (296), 280 states have call successors, (296) [2023-12-22 02:30:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4133 transitions. [2023-12-22 02:30:09,575 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4133 transitions. Word has length 242 [2023-12-22 02:30:09,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:30:09,576 INFO L495 AbstractCegarLoop]: Abstraction has 3734 states and 4133 transitions. [2023-12-22 02:30:09,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:30:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4133 transitions. [2023-12-22 02:30:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-22 02:30:09,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:30:09,579 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:30:09,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2023-12-22 02:30:09,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:09,784 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:30:09,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:30:09,785 INFO L85 PathProgramCache]: Analyzing trace with hash 464717916, now seen corresponding path program 1 times [2023-12-22 02:30:09,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:30:09,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573039709] [2023-12-22 02:30:09,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:30:09,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:09,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:30:09,786 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:30:09,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2023-12-22 02:30:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:30:09,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:30:09,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:30:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-22 02:30:09,981 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:30:09,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:30:09,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573039709] [2023-12-22 02:30:09,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573039709] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:30:09,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:30:09,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:30:09,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797495519] [2023-12-22 02:30:09,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:30:09,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:30:09,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:30:09,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:30:09,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:09,982 INFO L87 Difference]: Start difference. First operand 3734 states and 4133 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:30:10,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:30:10,437 INFO L93 Difference]: Finished difference Result 8374 states and 9395 transitions. [2023-12-22 02:30:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:30:10,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 243 [2023-12-22 02:30:10,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:30:10,443 INFO L225 Difference]: With dead ends: 8374 [2023-12-22 02:30:10,443 INFO L226 Difference]: Without dead ends: 4208 [2023-12-22 02:30:10,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:10,447 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 137 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:30:10,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 326 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:30:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4208 states. [2023-12-22 02:30:10,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4208 to 4175. [2023-12-22 02:30:10,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4175 states, 3622 states have (on average 1.0916620651573716) internal successors, (3954), 3643 states have internal predecessors, (3954), 314 states have call successors, (314), 220 states have call predecessors, (314), 238 states have return successors, (342), 312 states have call predecessors, (342), 314 states have call successors, (342) [2023-12-22 02:30:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4175 states to 4175 states and 4610 transitions. [2023-12-22 02:30:10,739 INFO L78 Accepts]: Start accepts. Automaton has 4175 states and 4610 transitions. Word has length 243 [2023-12-22 02:30:10,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:30:10,740 INFO L495 AbstractCegarLoop]: Abstraction has 4175 states and 4610 transitions. [2023-12-22 02:30:10,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:30:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4175 states and 4610 transitions. [2023-12-22 02:30:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-22 02:30:10,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:30:10,743 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:30:10,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2023-12-22 02:30:10,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:10,947 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:30:10,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:30:10,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1391979245, now seen corresponding path program 1 times [2023-12-22 02:30:10,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:30:10,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331835357] [2023-12-22 02:30:10,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:30:10,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:10,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:30:10,949 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:30:10,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-12-22 02:30:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:30:11,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:30:11,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:30:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-22 02:30:11,173 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:30:11,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:30:11,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331835357] [2023-12-22 02:30:11,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331835357] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:30:11,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:30:11,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:30:11,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608299836] [2023-12-22 02:30:11,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:30:11,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:30:11,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:30:11,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:30:11,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:11,175 INFO L87 Difference]: Start difference. First operand 4175 states and 4610 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:30:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:30:11,672 INFO L93 Difference]: Finished difference Result 9151 states and 10256 transitions. [2023-12-22 02:30:11,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:30:11,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 244 [2023-12-22 02:30:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:30:11,678 INFO L225 Difference]: With dead ends: 9151 [2023-12-22 02:30:11,678 INFO L226 Difference]: Without dead ends: 4584 [2023-12-22 02:30:11,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:11,681 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 123 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:30:11,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 325 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:30:11,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2023-12-22 02:30:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 4537. [2023-12-22 02:30:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4537 states, 3932 states have (on average 1.0859613428280772) internal successors, (4270), 3955 states have internal predecessors, (4270), 344 states have call successors, (344), 240 states have call predecessors, (344), 260 states have return successors, (386), 342 states have call predecessors, (386), 344 states have call successors, (386) [2023-12-22 02:30:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 5000 transitions. [2023-12-22 02:30:11,999 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 5000 transitions. Word has length 244 [2023-12-22 02:30:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:30:12,000 INFO L495 AbstractCegarLoop]: Abstraction has 4537 states and 5000 transitions. [2023-12-22 02:30:12,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:30:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 5000 transitions. [2023-12-22 02:30:12,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-22 02:30:12,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:30:12,003 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:30:12,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Ended with exit code 0 [2023-12-22 02:30:12,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:12,207 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:30:12,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:30:12,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1910478153, now seen corresponding path program 1 times [2023-12-22 02:30:12,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:30:12,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246089434] [2023-12-22 02:30:12,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:30:12,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:12,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:30:12,211 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:30:12,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2023-12-22 02:30:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:30:12,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:30:12,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:30:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-22 02:30:12,380 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:30:12,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:30:12,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246089434] [2023-12-22 02:30:12,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246089434] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:30:12,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:30:12,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:30:12,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444553106] [2023-12-22 02:30:12,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:30:12,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:30:12,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:30:12,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:30:12,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:12,382 INFO L87 Difference]: Start difference. First operand 4537 states and 5000 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-22 02:30:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:30:12,804 INFO L93 Difference]: Finished difference Result 7296 states and 8136 transitions. [2023-12-22 02:30:12,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:30:12,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 246 [2023-12-22 02:30:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:30:12,813 INFO L225 Difference]: With dead ends: 7296 [2023-12-22 02:30:12,813 INFO L226 Difference]: Without dead ends: 4539 [2023-12-22 02:30:12,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:12,818 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 123 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:30:12,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 387 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:30:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4539 states. [2023-12-22 02:30:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4539 to 4537. [2023-12-22 02:30:13,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4537 states, 3932 states have (on average 1.0768056968463886) internal successors, (4234), 3955 states have internal predecessors, (4234), 344 states have call successors, (344), 240 states have call predecessors, (344), 260 states have return successors, (386), 342 states have call predecessors, (386), 344 states have call successors, (386) [2023-12-22 02:30:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 4964 transitions. [2023-12-22 02:30:13,188 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 4964 transitions. Word has length 246 [2023-12-22 02:30:13,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:30:13,189 INFO L495 AbstractCegarLoop]: Abstraction has 4537 states and 4964 transitions. [2023-12-22 02:30:13,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-22 02:30:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 4964 transitions. [2023-12-22 02:30:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-12-22 02:30:13,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:30:13,193 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:30:13,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Ended with exit code 0 [2023-12-22 02:30:13,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:13,398 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:30:13,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:30:13,398 INFO L85 PathProgramCache]: Analyzing trace with hash -611116859, now seen corresponding path program 1 times [2023-12-22 02:30:13,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:30:13,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918233423] [2023-12-22 02:30:13,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:30:13,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:13,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:30:13,400 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:30:13,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2023-12-22 02:30:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:30:13,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:30:13,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:30:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-12-22 02:30:13,569 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:30:13,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:30:13,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918233423] [2023-12-22 02:30:13,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918233423] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:30:13,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:30:13,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:30:13,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850941648] [2023-12-22 02:30:13,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:30:13,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:30:13,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:30:13,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:30:13,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:13,571 INFO L87 Difference]: Start difference. First operand 4537 states and 4964 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:30:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:30:13,940 INFO L93 Difference]: Finished difference Result 8254 states and 9122 transitions. [2023-12-22 02:30:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:30:13,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 248 [2023-12-22 02:30:13,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:30:13,950 INFO L225 Difference]: With dead ends: 8254 [2023-12-22 02:30:13,950 INFO L226 Difference]: Without dead ends: 4537 [2023-12-22 02:30:13,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:13,956 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 129 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:30:13,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 349 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:30:13,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4537 states. [2023-12-22 02:30:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4537 to 4537. [2023-12-22 02:30:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4537 states, 3932 states have (on average 1.0661241098677519) internal successors, (4192), 3955 states have internal predecessors, (4192), 344 states have call successors, (344), 240 states have call predecessors, (344), 260 states have return successors, (386), 342 states have call predecessors, (386), 344 states have call successors, (386) [2023-12-22 02:30:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 4922 transitions. [2023-12-22 02:30:14,293 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 4922 transitions. Word has length 248 [2023-12-22 02:30:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:30:14,293 INFO L495 AbstractCegarLoop]: Abstraction has 4537 states and 4922 transitions. [2023-12-22 02:30:14,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:30:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 4922 transitions. [2023-12-22 02:30:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2023-12-22 02:30:14,297 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:30:14,297 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:30:14,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2023-12-22 02:30:14,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:14,501 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:30:14,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:30:14,502 INFO L85 PathProgramCache]: Analyzing trace with hash 712546465, now seen corresponding path program 1 times [2023-12-22 02:30:14,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:30:14,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657380868] [2023-12-22 02:30:14,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:30:14,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:14,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:30:14,504 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:30:14,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2023-12-22 02:30:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:30:14,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:30:14,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:30:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-12-22 02:30:14,648 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:30:14,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:30:14,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657380868] [2023-12-22 02:30:14,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657380868] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:30:14,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:30:14,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:30:14,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417943984] [2023-12-22 02:30:14,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:30:14,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:30:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:30:14,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:30:14,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:14,649 INFO L87 Difference]: Start difference. First operand 4537 states and 4922 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:30:14,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:30:14,984 INFO L93 Difference]: Finished difference Result 5754 states and 6257 transitions. [2023-12-22 02:30:14,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:30:14,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 251 [2023-12-22 02:30:14,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:30:14,991 INFO L225 Difference]: With dead ends: 5754 [2023-12-22 02:30:14,991 INFO L226 Difference]: Without dead ends: 3919 [2023-12-22 02:30:14,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:14,994 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 149 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:30:14,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 392 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:30:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2023-12-22 02:30:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3919. [2023-12-22 02:30:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3400 states have (on average 1.0626470588235295) internal successors, (3613), 3420 states have internal predecessors, (3613), 295 states have call successors, (295), 206 states have call predecessors, (295), 223 states have return successors, (315), 293 states have call predecessors, (315), 295 states have call successors, (315) [2023-12-22 02:30:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 4223 transitions. [2023-12-22 02:30:15,299 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 4223 transitions. Word has length 251 [2023-12-22 02:30:15,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:30:15,300 INFO L495 AbstractCegarLoop]: Abstraction has 3919 states and 4223 transitions. [2023-12-22 02:30:15,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:30:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 4223 transitions. [2023-12-22 02:30:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-12-22 02:30:15,303 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:30:15,304 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:30:15,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2023-12-22 02:30:15,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:15,508 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:30:15,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:30:15,509 INFO L85 PathProgramCache]: Analyzing trace with hash 576260783, now seen corresponding path program 2 times [2023-12-22 02:30:15,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:30:15,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491288233] [2023-12-22 02:30:15,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 02:30:15,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:15,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:30:15,518 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:30:15,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2023-12-22 02:30:15,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-22 02:30:15,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 02:30:15,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:30:15,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:30:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-12-22 02:30:15,689 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:30:15,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:30:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491288233] [2023-12-22 02:30:15,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491288233] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:30:15,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:30:15,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:30:15,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605593331] [2023-12-22 02:30:15,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:30:15,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:30:15,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:30:15,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:30:15,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:15,691 INFO L87 Difference]: Start difference. First operand 3919 states and 4223 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-22 02:30:15,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:30:15,994 INFO L93 Difference]: Finished difference Result 4951 states and 5331 transitions. [2023-12-22 02:30:15,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:30:15,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 253 [2023-12-22 02:30:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:30:16,000 INFO L225 Difference]: With dead ends: 4951 [2023-12-22 02:30:16,001 INFO L226 Difference]: Without dead ends: 3734 [2023-12-22 02:30:16,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:30:16,011 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 144 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:30:16,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 435 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:30:16,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2023-12-22 02:30:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3734. [2023-12-22 02:30:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3241 states have (on average 1.0610922554767048) internal successors, (3439), 3260 states have internal predecessors, (3439), 280 states have call successors, (280), 196 states have call predecessors, (280), 212 states have return successors, (296), 278 states have call predecessors, (296), 280 states have call successors, (296) [2023-12-22 02:30:16,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4015 transitions. [2023-12-22 02:30:16,310 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4015 transitions. Word has length 253 [2023-12-22 02:30:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:30:16,310 INFO L495 AbstractCegarLoop]: Abstraction has 3734 states and 4015 transitions. [2023-12-22 02:30:16,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-22 02:30:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4015 transitions. [2023-12-22 02:30:16,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-12-22 02:30:16,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:30:16,313 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:30:16,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2023-12-22 02:30:16,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:16,517 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:30:16,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:30:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash 204440145, now seen corresponding path program 3 times [2023-12-22 02:30:16,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:30:16,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715324635] [2023-12-22 02:30:16,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-22 02:30:16,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:16,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:30:16,519 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:30:16,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2023-12-22 02:30:16,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-22 02:30:16,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 02:30:16,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:30:16,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:30:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 124 proven. 159 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-22 02:30:16,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:30:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2023-12-22 02:30:17,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:30:17,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715324635] [2023-12-22 02:30:17,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715324635] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 02:30:17,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 02:30:17,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2023-12-22 02:30:17,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9847987] [2023-12-22 02:30:17,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:30:17,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:30:17,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:30:17,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:30:17,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:30:17,029 INFO L87 Difference]: Start difference. First operand 3734 states and 4015 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-22 02:30:17,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:30:17,696 INFO L93 Difference]: Finished difference Result 3734 states and 4015 transitions. [2023-12-22 02:30:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:30:17,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 254 [2023-12-22 02:30:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:30:17,697 INFO L225 Difference]: With dead ends: 3734 [2023-12-22 02:30:17,697 INFO L226 Difference]: Without dead ends: 0 [2023-12-22 02:30:17,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:30:17,700 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 465 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-22 02:30:17,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1576 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 02:30:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-22 02:30:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-22 02:30:17,700 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) [2023-12-22 02:30:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-22 02:30:17,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 254 [2023-12-22 02:30:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:30:17,701 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-22 02:30:17,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-22 02:30:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-22 02:30:17,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-22 02:30:17,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-22 02:30:17,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-22 02:30:17,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2023-12-22 02:30:17,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:30:17,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-22 02:30:44,425 WARN L293 SmtUtils]: Spent 7.89s on a formula simplification. DAG size of input: 284 DAG size of output: 172 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:31:11,211 WARN L293 SmtUtils]: Spent 12.47s on a formula simplification. DAG size of input: 332 DAG size of output: 172 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:31:22,805 WARN L293 SmtUtils]: Spent 11.08s on a formula simplification. DAG size of input: 332 DAG size of output: 172 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:31:28,329 WARN L293 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 179 DAG size of output: 117 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:31:33,479 WARN L293 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 179 DAG size of output: 117 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:31:43,328 WARN L293 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 179 DAG size of output: 117 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:31:49,049 WARN L293 SmtUtils]: Spent 5.72s on a formula simplification. DAG size of input: 179 DAG size of output: 117 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:32:02,627 WARN L293 SmtUtils]: Spent 12.90s on a formula simplification. DAG size of input: 483 DAG size of output: 191 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:32:08,065 WARN L293 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 179 DAG size of output: 117 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:32:21,035 WARN L293 SmtUtils]: Spent 5.72s on a formula simplification. DAG size of input: 179 DAG size of output: 117 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:32:26,670 WARN L293 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 179 DAG size of output: 117 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:32:27,341 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 934 944) no Hoare annotation was computed. [2023-12-22 02:32:27,341 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 934 944) no Hoare annotation was computed. [2023-12-22 02:32:27,342 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 934 944) the Hoare annotation is: (let ((.cse39 (= ~t2_st~0 (_ bv0 32))) (.cse25 (= ~t2_pc~0 (_ bv1 32))) (.cse45 (= ~t3_st~0 (_ bv0 32))) (.cse50 (= |old(~t3_st~0)| ~t3_st~0)) (.cse52 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse51 (= (_ bv2 32) ~m_st~0)) (.cse54 (= |old(~t2_st~0)| ~t2_st~0)) (.cse37 (= |old(~m_st~0)| ~m_st~0)) (.cse44 (= ~t2_st~0 (_ bv2 32))) (.cse46 (= ~t1_st~0 (_ bv2 32))) (.cse40 (= ~t3_st~0 (_ bv2 32)))) (let ((.cse20 (and .cse37 .cse44 .cse46 .cse40)) (.cse43 (and .cse50 .cse52 .cse51 .cse54)) (.cse26 (and .cse37 .cse44 .cse45 .cse46)) (.cse31 (and .cse44 .cse52 .cse51 .cse40)) (.cse36 (not (= (_ bv0 32) |old(~t1_st~0)|))) (.cse38 (= ~t1_st~0 (_ bv0 32))) (.cse42 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse47 (and .cse51 .cse46 .cse54 .cse40)) (.cse48 (not .cse25)) (.cse34 (= ~t3_pc~0 (_ bv1 32))) (.cse15 (not (= |old(~t2_st~0)| (_ bv2 32)))) (.cse16 (not (= (_ bv1 32) ~m_pc~0))) (.cse33 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse49 (and .cse44 .cse45 .cse52 .cse51)) (.cse6 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse9 (not (= ~local~0 ~token~0))) (.cse27 (not (= (_ bv0 32) ~m_pc~0))) (.cse11 (not (= |old(~t3_st~0)| (_ bv2 32)))) (.cse53 (and .cse37 .cse39 .cse46 .cse40)) (.cse35 (not (= |old(~t2_st~0)| (_ bv0 32)))) (.cse1 (not (= (_ bv2 32) ~E_3~0))) (.cse41 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse30 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse2 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse3 (not (= (_ bv2 32) ~T3_E~0))) (.cse4 (not (= (_ bv2 32) ~T1_E~0))) (.cse5 (not (= ~c_dr_st~0 (_ bv0 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 (= (_ bv2 32) |old(~t1_st~0)|))) (.cse13 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse28 (not (= |old(~t3_st~0)| (_ bv0 32)))) (.cse14 (not (= (_ bv2 32) ~T2_E~0))) (.cse32 (not (= (_ bv2 32) ~E_1~0))) (.cse17 (not (= (_ bv2 32) ~E_M~0))) (.cse18 (not (= (_ bv1 32) ~t2_i~0))) (.cse19 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse29 (not (= ~t3_pc~0 (_ bv0 32)))) (.cse21 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse22 (not (= (_ bv1 32) ~t3_i~0))) (.cse23 (not (= (_ bv2 32) ~E_2~0))) (.cse24 (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 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse26 .cse27 .cse10 .cse12 .cse13 .cse28 .cse14 .cse15 .cse17 .cse18 .cse19 .cse29 .cse21 .cse22 .cse23 .cse24) (or .cse30 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse31 .cse15 .cse32 .cse16 .cse17 .cse18 .cse19 .cse33 .cse21 .cse22 .cse24) (or .cse0 .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse34) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse35 .cse1 .cse2 .cse3 .cse4 .cse36 .cse5 .cse7 .cse8 (and .cse37 .cse38 .cse39 .cse40) .cse41 .cse27 .cse10 .cse11 .cse13 .cse14 .cse17 .cse18 .cse19 .cse42 .cse21 .cse22 .cse23 .cse24) (or .cse30 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse27 .cse10 .cse43 .cse13 .cse14 .cse32 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse36 .cse5 .cse7 .cse8 .cse27 .cse10 (and .cse37 .cse44 .cse38 .cse45) .cse13 .cse28 .cse14 .cse15 .cse17 .cse18 .cse19 .cse29 .cse42 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse35 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse41 .cse9 (and .cse37 .cse45 .cse39 .cse46) .cse27 .cse10 .cse12 .cse13 .cse28 .cse14 .cse17 .cse18 .cse19 .cse29 .cse21 .cse22 .cse23 .cse24) (or .cse30 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse27 .cse10 .cse43 .cse13 .cse14 .cse32 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse35 .cse1 .cse2 (and .cse37 .cse38 .cse45 .cse39) .cse3 .cse4 .cse36 .cse5 .cse7 .cse8 .cse41 .cse27 .cse10 .cse13 .cse28 .cse14 .cse17 .cse18 .cse19 .cse29 .cse42 .cse21 .cse22 .cse23 .cse24) (or .cse30 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse47 .cse10 .cse11 .cse48 .cse12 .cse13 .cse14 .cse32 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32)))) .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse30 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse31 .cse15 .cse32 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24 .cse34) (or .cse30 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse27 .cse10 .cse43 .cse13 .cse14 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse27 .cse10 .cse12 .cse13 .cse28 .cse14 .cse15 .cse17 .cse18 .cse19 .cse29 .cse21 .cse22 .cse23 .cse24) (or .cse30 .cse0 .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse31 .cse15 .cse32 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse36 .cse5 .cse7 .cse8 .cse27 .cse10 .cse11 (and .cse37 .cse44 .cse38 .cse40) .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse42 .cse21 .cse22 .cse23 .cse24) (or .cse30 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse47 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse34) (or .cse30 .cse0 .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse13 .cse28 .cse14 .cse15 .cse32 .cse17 .cse18 .cse19 .cse29 .cse21 .cse22 .cse24 .cse49) (or .cse30 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= (bvadd ~local~0 (_ bv3 32)) ~token~0)) .cse10 .cse48 .cse12 .cse13 .cse14 .cse15 .cse32 (not .cse34) .cse16 .cse18 .cse19 (and .cse50 .cse44 .cse51 .cse46) .cse21 .cse22 .cse23 .cse24) (or .cse30 .cse0 .cse35 .cse1 .cse2 (and .cse52 .cse39 .cse51 .cse40) .cse3 .cse4 .cse5 .cse7 .cse8 .cse41 .cse10 .cse11 .cse13 .cse14 .cse32 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24) (or .cse0 .cse35 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse41 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse53 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse34) (or .cse30 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse28 .cse14 .cse15 .cse32 .cse16 .cse17 .cse18 .cse19 .cse29 .cse33 .cse21 .cse22 .cse24 .cse49) (or .cse0 .cse35 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse41 .cse9 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse53 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse30 .cse0 .cse35 .cse1 .cse2 (and .cse45 .cse52 .cse39 .cse51) .cse3 .cse4 .cse5 .cse7 .cse8 .cse41 .cse10 .cse13 .cse28 .cse14 .cse32 .cse17 .cse18 .cse19 .cse29 .cse21 .cse22 .cse24) (or .cse30 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse12 .cse13 .cse28 .cse14 .cse32 (and .cse45 .cse51 .cse46 .cse54) .cse17 .cse18 .cse19 .cse29 .cse21 .cse22 .cse23 .cse24)))) [2023-12-22 02:32:27,343 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2023-12-22 02:32:27,343 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2023-12-22 02:32:27,343 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2023-12-22 02:32:27,343 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 84 108) the Hoare annotation is: (let ((.cse0 (= (_ bv2 32) ~c_dr_st~0)) (.cse2 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse3 (not (= (_ bv2 32) ~M_E~0))) (.cse4 (not (= (_ bv2 32) ~E_3~0))) (.cse5 (not (= (_ bv2 32) ~T3_E~0))) (.cse6 (not (= (_ bv2 32) ~T1_E~0))) (.cse7 (not (= (_ bv0 32) ~m_pc~0))) (.cse13 (not (= ~q_free~0 (_ bv0 32)))) (.cse8 (not (= (_ bv2 32) ~T2_E~0))) (.cse9 (not (= (_ bv2 32) ~E_1~0))) (.cse10 (not (= (_ bv2 32) ~E_M~0))) (.cse1 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse11 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= (_ bv2 32) ~E_2~0)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 (not (= ~p_num_write~0 ~c_num_read~0)) .cse5 .cse6 .cse7 .cse8 (and (= ~p_dw_st~0 (_ bv2 32)) (= |old(~c_dr_st~0)| ~c_dr_st~0)) .cse9 .cse10 .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 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) .cse9 .cse10 .cse0 .cse2 .cse11 .cse12) (or .cse3 (not (= ~p_dw_pc~0 (_ bv0 32))) (not (= ~p_num_write~0 (_ bv1 32))) .cse4 .cse5 .cse6 (not (= ~c_num_read~0 (_ bv0 32))) (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse7 .cse13 .cse8 .cse9 .cse10 .cse1 (= ~c_dr_st~0 (_ bv0 32)) .cse11 .cse12))) [2023-12-22 02:32:27,343 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2023-12-22 02:32:27,343 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 104) no Hoare annotation was computed. [2023-12-22 02:32:27,343 INFO L899 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2023-12-22 02:32:27,343 INFO L899 garLoopResultBuilder]: For program point L100-2(lines 84 108) no Hoare annotation was computed. [2023-12-22 02:32:27,343 INFO L899 garLoopResultBuilder]: For program point L61(lines 49 63) no Hoare annotation was computed. [2023-12-22 02:32:27,343 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2023-12-22 02:32:27,343 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 96) no Hoare annotation was computed. [2023-12-22 02:32:27,343 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2023-12-22 02:32:27,344 INFO L899 garLoopResultBuilder]: For program point L80(lines 68 82) no Hoare annotation was computed. [2023-12-22 02:32:27,344 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2023-12-22 02:32:27,344 INFO L899 garLoopResultBuilder]: For program point L834-1(lines 795 842) no Hoare annotation was computed. [2023-12-22 02:32:27,344 INFO L899 garLoopResultBuilder]: For program point L799-1(lines 798 841) no Hoare annotation was computed. [2023-12-22 02:32:27,344 INFO L899 garLoopResultBuilder]: For program point L824-1(lines 798 841) no Hoare annotation was computed. [2023-12-22 02:32:27,344 INFO L899 garLoopResultBuilder]: For program point L814-1(lines 798 841) no Hoare annotation was computed. [2023-12-22 02:32:27,345 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 795 842) the Hoare annotation is: (let ((.cse37 (= ~t2_pc~0 (_ bv1 32)))) (let ((.cse31 (not (= ~t3_pc~0 (_ bv0 32)))) (.cse36 (= ~t3_pc~0 (_ bv1 32))) (.cse32 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse34 (not (= ~t1_st~0 (_ bv0 32)))) (.cse35 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse5 (not (= ~t2_st~0 (_ bv2 32)))) (.cse27 (not (= ~t3_st~0 (_ bv0 32)))) (.cse38 (not .cse37)) (.cse29 (not (= (_ bv1 32) ~m_pc~0))) (.cse30 (not (= (_ bv2 32) ~m_st~0))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not (= (_ bv0 32) ~m_st~0))) (.cse2 (not (= (_ bv2 32) |old(~E_M~0)|))) (.cse3 (and (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T2_E~0) (= (_ bv2 32) ~T3_E~0) (= (_ bv2 32) ~E_2~0) (= (_ bv2 32) ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (= (_ bv2 32) ~E_1~0) (= (_ bv2 32) ~E_3~0))) (.cse4 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse6 (not (= (_ bv2 32) |old(~E_1~0)|))) (.cse7 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse8 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse9 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse10 (not (= (_ bv1 32) ~t1_i~0))) (.cse11 (not (= (_ bv2 32) |old(~E_2~0)|))) (.cse33 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse12 (not (= ~local~0 ~token~0))) (.cse13 (not (= (_ bv0 32) ~m_pc~0))) (.cse14 (not (= ~q_free~0 (_ bv0 32)))) (.cse15 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse16 (not (= (_ bv2 32) |old(~E_3~0)|))) (.cse17 (not (= (_ bv2 32) |old(~T2_E~0)|))) (.cse18 (not (= (_ bv2 32) |old(~T1_E~0)|))) (.cse28 (not (= ~t2_st~0 (_ bv0 32)))) (.cse19 (not (= (_ bv1 32) ~t2_i~0))) (.cse20 (not (= ~t1_st~0 (_ bv2 32)))) (.cse21 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse22 (not (= ~t3_st~0 (_ bv2 32)))) (.cse23 (not (= (_ bv2 32) |old(~T3_E~0)|))) (.cse24 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (= (_ bv1 32) ~t3_i~0))) (.cse26 (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 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse19 .cse20 .cse30 .cse21 .cse31 .cse32 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse33 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse19 .cse21 .cse22 .cse35 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse37 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse37 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse31 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse21 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse35 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse33 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse19 .cse30 .cse21 .cse31 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse37 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse30 .cse21 .cse31 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse21 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse37 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse33 .cse12 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse29 .cse19 .cse30 .cse21 .cse31 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse33 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse19 .cse30 .cse21 .cse22 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse12 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse29 .cse19 .cse30 .cse21 .cse31 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse33 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse19 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse37 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse37 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse21 .cse31 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse31 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (bvadd ~local~0 (_ bv3 32)) ~token~0)) .cse14 .cse38 .cse15 .cse16 .cse17 .cse18 (not .cse36) .cse29 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse19 .cse21 .cse22 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse37 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse30 .cse21 .cse31 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse29 .cse19 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse37 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse21 .cse31 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse19 .cse21 .cse31 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse29 .cse19 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse30 .cse21 .cse31 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse31 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse19 .cse20 .cse30 .cse21 .cse22 .cse32 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse30 .cse21 .cse22 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse14 .cse38 .cse15 .cse16 .cse17 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32)))) .cse18 .cse29 .cse19 .cse20 .cse30 .cse21 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2023-12-22 02:32:27,345 INFO L899 garLoopResultBuilder]: For program point L804-1(lines 798 841) no Hoare annotation was computed. [2023-12-22 02:32:27,345 INFO L899 garLoopResultBuilder]: For program point L829-1(lines 798 841) no Hoare annotation was computed. [2023-12-22 02:32:27,345 INFO L899 garLoopResultBuilder]: For program point L819-1(lines 798 841) no Hoare annotation was computed. [2023-12-22 02:32:27,345 INFO L899 garLoopResultBuilder]: For program point L809-1(lines 798 841) no Hoare annotation was computed. [2023-12-22 02:32:27,345 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 795 842) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 606) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L597-2(lines 597 606) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L589(lines 577 591) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L635(lines 635 644) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L635-2(lines 635 644) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L598(lines 598 603) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L627(lines 615 629) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L578(lines 578 587) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L578-2(lines 578 587) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L925(lines 925 929) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L636(lines 636 641) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L925-2(lines 891 933) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 921) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L917-2(lines 917 921) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L909(lines 909 913) no Hoare annotation was computed. [2023-12-22 02:32:27,346 INFO L899 garLoopResultBuilder]: For program point L909-2(lines 909 913) no Hoare annotation was computed. [2023-12-22 02:32:27,347 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 891 933) the Hoare annotation is: (let ((.cse40 (= ~t2_st~0 (_ bv0 32))) (.cse29 (= ~t2_pc~0 (_ bv1 32))) (.cse48 (= ~t3_st~0 (_ bv0 32))) (.cse56 (= |old(~t3_st~0)| ~t3_st~0)) (.cse57 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse60 (= |old(~t2_st~0)| ~t2_st~0)) (.cse39 (= ~t1_st~0 (_ bv0 32))) (.cse46 (= (_ bv2 32) ~m_st~0)) (.cse38 (= |old(~m_st~0)| ~m_st~0)) (.cse45 (= ~t2_st~0 (_ bv2 32))) (.cse47 (= ~t1_st~0 (_ bv2 32))) (.cse41 (= ~t3_st~0 (_ bv2 32)))) (let ((.cse20 (and .cse38 .cse45 .cse47 .cse41)) (.cse25 (and .cse45 .cse39 .cse46 .cse41)) (.cse44 (and .cse56 .cse57 .cse46 .cse60)) (.cse30 (and .cse38 .cse45 .cse48 .cse47)) (.cse34 (and .cse45 .cse57 .cse46 .cse41)) (.cse50 (and .cse46 .cse47 .cse60 .cse41)) (.cse55 (not (= (bvadd ~local~0 (_ bv3 32)) ~token~0))) (.cse51 (not .cse29)) (.cse52 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32))))) (.cse53 (and .cse45 .cse48 .cse46 .cse47)) (.cse36 (= ~t3_pc~0 (_ bv1 32))) (.cse43 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse49 (and .cse40 .cse46 .cse47 .cse41)) (.cse35 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse54 (and .cse45 .cse48 .cse57 .cse46)) (.cse31 (not (= (_ bv0 32) ~m_pc~0))) (.cse11 (not (= |old(~t3_st~0)| (_ bv2 32)))) (.cse58 (and .cse38 .cse40 .cse47 .cse41)) (.cse59 (and .cse45 .cse39 .cse48 .cse46)) (.cse27 (not (= (_ bv0 32) |old(~t1_st~0)|))) (.cse6 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse9 (not (= ~local~0 ~token~0))) (.cse15 (not (= |old(~t2_st~0)| (_ bv2 32)))) (.cse16 (not (= (_ bv1 32) ~m_pc~0))) (.cse37 (not (= |old(~t2_st~0)| (_ bv0 32)))) (.cse1 (not (= (_ bv2 32) ~E_3~0))) (.cse42 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse26 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse2 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse3 (not (= (_ bv2 32) ~T3_E~0))) (.cse4 (not (= (_ bv2 32) ~T1_E~0))) (.cse5 (not (= ~c_dr_st~0 (_ bv0 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 (= (_ bv2 32) |old(~t1_st~0)|))) (.cse13 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse32 (not (= |old(~t3_st~0)| (_ bv0 32)))) (.cse14 (not (= (_ bv2 32) ~T2_E~0))) (.cse28 (not (= (_ bv2 32) ~E_1~0))) (.cse17 (not (= (_ bv2 32) ~E_M~0))) (.cse18 (not (= (_ bv1 32) ~t2_i~0))) (.cse19 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse33 (not (= ~t3_pc~0 (_ bv0 32)))) (.cse21 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse22 (not (= (_ bv1 32) ~t3_i~0))) (.cse23 (not (= (_ bv2 32) ~E_2~0))) (.cse24 (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 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse25 .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse30 .cse31 .cse10 .cse12 .cse13 .cse32 .cse14 .cse15 .cse17 .cse18 .cse19 .cse33 .cse21 .cse22 .cse23 .cse24) (or .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse34 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse35 .cse21 .cse22 .cse24) (or .cse0 .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse31 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse37 .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse7 .cse8 (and .cse38 .cse39 .cse40 .cse41) .cse42 .cse31 .cse10 .cse11 .cse13 .cse14 .cse17 .cse18 .cse19 .cse43 .cse21 .cse22 .cse23 .cse24) (or .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse31 .cse10 .cse44 .cse13 .cse14 .cse28 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24) (or .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse45 .cse46 .cse47 .cse41) .cse28 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse25 .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse28 .cse17 .cse18 .cse19 .cse43 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse7 .cse8 .cse31 .cse10 (and .cse38 .cse45 .cse39 .cse48) .cse13 .cse32 .cse14 .cse15 .cse17 .cse18 .cse19 .cse33 .cse43 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse37 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse42 .cse9 (and .cse38 .cse48 .cse40 .cse47) .cse31 .cse10 .cse12 .cse13 .cse32 .cse14 .cse17 .cse18 .cse19 .cse33 .cse21 .cse22 .cse23 .cse24) (or .cse26 .cse0 .cse37 .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse49 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse26 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse31 .cse10 .cse44 .cse13 .cse14 .cse28 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse37 .cse1 .cse2 (and .cse38 .cse39 .cse48 .cse40) .cse3 .cse4 .cse27 .cse5 .cse7 .cse8 .cse42 .cse31 .cse10 .cse13 .cse32 .cse14 .cse17 .cse18 .cse19 .cse33 .cse43 .cse21 .cse22 .cse23 .cse24) (or .cse26 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse50 .cse10 .cse11 .cse51 .cse12 .cse13 .cse14 .cse28 .cse52 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse34 .cse15 .cse28 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24 .cse36) (or .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse31 .cse10 .cse44 .cse13 .cse14 .cse28 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse30 .cse9 .cse31 .cse10 .cse12 .cse13 .cse32 .cse14 .cse15 .cse17 .cse18 .cse19 .cse33 .cse21 .cse22 .cse23 .cse24) (or .cse26 .cse0 .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse34 .cse15 .cse28 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse7 .cse8 .cse31 .cse10 .cse11 (and .cse38 .cse45 .cse39 .cse41) .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse43 .cse21 .cse22 .cse23 .cse24) (or .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse12 .cse13 .cse32 .cse14 .cse15 .cse28 .cse17 .cse18 .cse19 .cse21 .cse53 .cse22 .cse23 .cse24 .cse36) (or .cse26 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse50 .cse10 .cse11 .cse12 .cse13 .cse14 .cse28 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse36) (or .cse26 .cse0 .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse13 .cse32 .cse14 .cse15 .cse28 .cse17 .cse18 .cse19 .cse33 .cse21 .cse22 .cse24 .cse54) (or .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse55 .cse10 .cse51 .cse12 .cse13 .cse14 .cse15 .cse28 (not .cse36) .cse16 .cse18 .cse19 (and .cse56 .cse45 .cse46 .cse47) .cse21 .cse22 .cse23 .cse24) (or (not (= |old(~m_st~0)| (_ bv0 32))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse55 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 (and .cse45 (= (_ bv0 32) ~m_st~0) .cse47 .cse41) .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse26 .cse0 .cse37 .cse1 .cse2 (and .cse57 .cse40 .cse46 .cse41) .cse3 .cse4 .cse5 .cse7 .cse8 .cse42 .cse10 .cse11 .cse13 .cse14 .cse28 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24) (or .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse51 .cse12 .cse13 .cse32 .cse14 .cse15 .cse28 .cse52 .cse16 .cse17 .cse18 .cse19 .cse21 .cse53 .cse22 .cse23 .cse24) (or .cse0 .cse37 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse42 .cse31 .cse10 .cse11 .cse12 .cse13 .cse14 .cse58 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse36) (or .cse26 .cse0 .cse1 .cse59 .cse2 .cse3 .cse4 .cse27 .cse5 .cse7 .cse8 .cse10 .cse13 .cse32 .cse14 .cse15 .cse28 .cse17 .cse18 .cse19 .cse33 .cse43 .cse21 .cse22 .cse23 .cse24) (or .cse26 .cse0 .cse37 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse49 .cse11 .cse12 .cse13 .cse14 .cse28 .cse16 .cse17 .cse18 .cse19 .cse35 .cse21 .cse22 .cse23 .cse24) (or .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse32 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse33 .cse35 .cse21 .cse22 .cse24 .cse54) (or .cse0 .cse37 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse42 .cse9 .cse31 .cse10 .cse11 .cse12 .cse13 .cse14 .cse58 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse26 .cse0 .cse1 .cse59 .cse2 .cse3 .cse4 .cse27 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse32 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse33 .cse21 .cse22 .cse23 .cse24) (or .cse26 .cse0 .cse37 .cse1 .cse2 (and .cse48 .cse57 .cse40 .cse46) .cse3 .cse4 .cse5 .cse7 .cse8 .cse42 .cse10 .cse13 .cse32 .cse14 .cse28 .cse17 .cse18 .cse19 .cse33 .cse21 .cse22 .cse24) (or .cse26 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse12 .cse13 .cse32 .cse14 .cse28 (and .cse48 .cse46 .cse47 .cse60) .cse17 .cse18 .cse19 .cse33 .cse21 .cse22 .cse23 .cse24)))) [2023-12-22 02:32:27,347 INFO L899 garLoopResultBuilder]: For program point L616(lines 616 625) no Hoare annotation was computed. [2023-12-22 02:32:27,347 INFO L899 garLoopResultBuilder]: For program point L616-2(lines 616 625) no Hoare annotation was computed. [2023-12-22 02:32:27,347 INFO L899 garLoopResultBuilder]: For program point L901(lines 901 905) no Hoare annotation was computed. [2023-12-22 02:32:27,347 INFO L899 garLoopResultBuilder]: For program point L579(lines 579 584) no Hoare annotation was computed. [2023-12-22 02:32:27,347 INFO L899 garLoopResultBuilder]: For program point L901-2(lines 901 905) no Hoare annotation was computed. [2023-12-22 02:32:27,347 INFO L899 garLoopResultBuilder]: For program point L608(lines 596 610) no Hoare annotation was computed. [2023-12-22 02:32:27,347 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 891 933) no Hoare annotation was computed. [2023-12-22 02:32:27,347 INFO L899 garLoopResultBuilder]: For program point L617(lines 617 622) no Hoare annotation was computed. [2023-12-22 02:32:27,348 INFO L899 garLoopResultBuilder]: For program point L646(lines 634 648) no Hoare annotation was computed. [2023-12-22 02:32:27,348 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 650 657) no Hoare annotation was computed. [2023-12-22 02:32:27,348 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 650 657) the Hoare annotation is: true [2023-12-22 02:32:27,348 INFO L899 garLoopResultBuilder]: For program point L993-1(lines 954 1001) no Hoare annotation was computed. [2023-12-22 02:32:27,348 INFO L895 garLoopResultBuilder]: At program point L1060(line 1060) the Hoare annotation is: (let ((.cse35 (= ~t2_pc~0 (_ bv1 32))) (.cse37 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse38 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse34 (not .cse37)) (.cse24 (= ~t1_pc~0 (_ bv0 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse27 (not .cse35)) (.cse14 (= (_ bv0 32) ~m_st~0)) (.cse19 (= (_ bv0 32) ~m_pc~0)) (.cse30 (= ~t1_st~0 (_ bv2 32))) (.cse31 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse9 (= ~t1_st~0 (_ bv0 32))) (.cse10 (= (_ bv1 32) ~t3_i~0)) (.cse11 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv0 32))) (.cse13 (= ~t3_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~T1_E~0)) (.cse28 (= ~t2_st~0 (_ bv0 32))) (.cse16 (= ~p_last_write~0 ~c_last_read~0)) (.cse17 (= ~p_dw_st~0 (_ bv0 32))) (.cse36 (= (_ bv1 32) ~m_pc~0)) (.cse33 (= ~t2_pc~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_1~0)) (.cse20 (= ~c_dr_pc~0 (_ bv0 32))) (.cse29 (= (_ bv2 32) ~m_st~0)) (.cse21 (= ~local~0 ~token~0)) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse32 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse25 (= ~c_dr_st~0 (_ bv0 32))) (.cse26 (= ~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 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse27 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31 .cse37) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26)))) [2023-12-22 02:32:27,349 INFO L895 garLoopResultBuilder]: At program point L1060-1(line 1060) the Hoare annotation is: (let ((.cse35 (= ~t2_pc~0 (_ bv1 32))) (.cse37 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse38 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse34 (not .cse37)) (.cse24 (= ~t1_pc~0 (_ bv0 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse27 (not .cse35)) (.cse14 (= (_ bv0 32) ~m_st~0)) (.cse19 (= (_ bv0 32) ~m_pc~0)) (.cse30 (= ~t1_st~0 (_ bv2 32))) (.cse31 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse9 (= ~t1_st~0 (_ bv0 32))) (.cse10 (= (_ bv1 32) ~t3_i~0)) (.cse11 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv0 32))) (.cse13 (= ~t3_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~T1_E~0)) (.cse28 (= ~t2_st~0 (_ bv0 32))) (.cse16 (= ~p_last_write~0 ~c_last_read~0)) (.cse17 (= ~p_dw_st~0 (_ bv0 32))) (.cse36 (= (_ bv1 32) ~m_pc~0)) (.cse33 (= ~t2_pc~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_1~0)) (.cse20 (= ~c_dr_pc~0 (_ bv0 32))) (.cse29 (= (_ bv2 32) ~m_st~0)) (.cse21 (= ~local~0 ~token~0)) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse32 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse25 (= ~c_dr_st~0 (_ bv0 32))) (.cse26 (= ~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 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse27 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31 .cse37) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26)))) [2023-12-22 02:32:27,349 INFO L899 garLoopResultBuilder]: For program point L763(lines 763 770) no Hoare annotation was computed. [2023-12-22 02:32:27,349 INFO L899 garLoopResultBuilder]: For program point L763-2(lines 763 770) no Hoare annotation was computed. [2023-12-22 02:32:27,349 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 109 151) no Hoare annotation was computed. [2023-12-22 02:32:27,349 INFO L899 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2023-12-22 02:32:27,349 INFO L895 garLoopResultBuilder]: At program point L1061(line 1061) the Hoare annotation is: (let ((.cse35 (= ~t2_pc~0 (_ bv1 32))) (.cse37 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse38 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse34 (not .cse37)) (.cse24 (= ~t1_pc~0 (_ bv0 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse27 (not .cse35)) (.cse14 (= (_ bv0 32) ~m_st~0)) (.cse19 (= (_ bv0 32) ~m_pc~0)) (.cse30 (= ~t1_st~0 (_ bv2 32))) (.cse31 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse9 (= ~t1_st~0 (_ bv0 32))) (.cse10 (= (_ bv1 32) ~t3_i~0)) (.cse11 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv0 32))) (.cse13 (= ~t3_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~T1_E~0)) (.cse28 (= ~t2_st~0 (_ bv0 32))) (.cse16 (= ~p_last_write~0 ~c_last_read~0)) (.cse17 (= ~p_dw_st~0 (_ bv0 32))) (.cse36 (= (_ bv1 32) ~m_pc~0)) (.cse33 (= ~t2_pc~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_1~0)) (.cse20 (= ~c_dr_pc~0 (_ bv0 32))) (.cse29 (= (_ bv2 32) ~m_st~0)) (.cse21 (= ~local~0 ~token~0)) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse32 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse25 (= ~c_dr_st~0 (_ bv0 32))) (.cse26 (= ~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 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse27 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31 .cse37) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26)))) [2023-12-22 02:32:27,349 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2023-12-22 02:32:27,349 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2023-12-22 02:32:27,350 INFO L895 garLoopResultBuilder]: At program point L1062(line 1062) the Hoare annotation is: (let ((.cse35 (= ~t2_pc~0 (_ bv1 32))) (.cse37 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse38 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse34 (not .cse37)) (.cse24 (= ~t1_pc~0 (_ bv0 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse27 (not .cse35)) (.cse14 (= (_ bv0 32) ~m_st~0)) (.cse19 (= (_ bv0 32) ~m_pc~0)) (.cse30 (= ~t1_st~0 (_ bv2 32))) (.cse31 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse9 (= ~t1_st~0 (_ bv0 32))) (.cse10 (= (_ bv1 32) ~t3_i~0)) (.cse11 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv0 32))) (.cse13 (= ~t3_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~T1_E~0)) (.cse28 (= ~t2_st~0 (_ bv0 32))) (.cse16 (= ~p_last_write~0 ~c_last_read~0)) (.cse17 (= ~p_dw_st~0 (_ bv0 32))) (.cse36 (= (_ bv1 32) ~m_pc~0)) (.cse33 (= ~t2_pc~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_1~0)) (.cse20 (= ~c_dr_pc~0 (_ bv0 32))) (.cse29 (= (_ bv2 32) ~m_st~0)) (.cse21 (= ~local~0 ~token~0)) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse32 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse25 (= ~c_dr_st~0 (_ bv0 32))) (.cse26 (= ~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 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse27 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31 .cse37) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26)))) [2023-12-22 02:32:27,350 INFO L899 garLoopResultBuilder]: For program point L1029(lines 1018 1031) no Hoare annotation was computed. [2023-12-22 02:32:27,350 INFO L899 garLoopResultBuilder]: For program point L963-1(lines 957 1000) no Hoare annotation was computed. [2023-12-22 02:32:27,350 INFO L899 garLoopResultBuilder]: For program point L732-1(lines 722 788) no Hoare annotation was computed. [2023-12-22 02:32:27,350 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 466 501) no Hoare annotation was computed. [2023-12-22 02:32:27,350 INFO L899 garLoopResultBuilder]: For program point L667-1(lines 661 684) no Hoare annotation was computed. [2023-12-22 02:32:27,350 INFO L899 garLoopResultBuilder]: For program point L470(lines 470 478) no Hoare annotation was computed. [2023-12-22 02:32:27,350 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2023-12-22 02:32:27,350 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 1033 1091) no Hoare annotation was computed. [2023-12-22 02:32:27,350 INFO L899 garLoopResultBuilder]: For program point L1065(line 1065) no Hoare annotation was computed. [2023-12-22 02:32:27,350 INFO L899 garLoopResultBuilder]: For program point L735(lines 735 742) no Hoare annotation was computed. [2023-12-22 02:32:27,350 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 422 465) no Hoare annotation was computed. [2023-12-22 02:32:27,350 INFO L899 garLoopResultBuilder]: For program point L735-2(lines 735 742) no Hoare annotation was computed. [2023-12-22 02:32:27,351 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 321 349) no Hoare annotation was computed. [2023-12-22 02:32:27,351 INFO L895 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (let ((.cse11 (= (_ bv2 32) ~c_dr_st~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= (_ bv2 32) ~E_2~0)) (.cse5 (= (_ bv2 32) ~M_E~0)) (.cse6 (= ~q_free~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~T1_E~0)) (.cse8 (= (_ bv2 32) ~E_1~0)) (.cse9 (= (_ bv0 32) ~m_pc~0)) (.cse12 (= ~c_dr_pc~0 (_ bv0 32))) (.cse10 (= (_ bv2 32) ~E_3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse11) (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (_ bv1 32)) (= ~c_num_read~0 (_ bv0 32)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10 (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))))) [2023-12-22 02:32:27,351 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2023-12-22 02:32:27,351 INFO L899 garLoopResultBuilder]: For program point L1067(lines 1067 1076) no Hoare annotation was computed. [2023-12-22 02:32:27,351 INFO L899 garLoopResultBuilder]: For program point L1067-2(lines 1067 1076) no Hoare annotation was computed. [2023-12-22 02:32:27,351 INFO L899 garLoopResultBuilder]: For program point L968-1(lines 957 1000) no Hoare annotation was computed. [2023-12-22 02:32:27,351 INFO L899 garLoopResultBuilder]: For program point L506(lines 506 514) no Hoare annotation was computed. [2023-12-22 02:32:27,351 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 477) no Hoare annotation was computed. [2023-12-22 02:32:27,351 INFO L895 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse20 (= ~p_num_write~0 ~c_num_read~0)) (.cse21 (= ~q_free~0 (_ bv0 32))) (.cse9 (= ~p_dw_st~0 (_ bv2 32))) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= ~p_num_write~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= (_ bv2 32) ~T1_E~0)) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse18 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~E_1~0)) (.cse12 (= (_ bv0 32) ~m_pc~0)) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_3~0)) (.cse15 (= ~q_free~0 (_ bv1 32))) (.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 .cse6 .cse7 .cse8 .cse18 .cse11 .cse12 .cse14 .cse15 .cse19 .cse20) (and .cse13 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse21 .cse8 .cse9 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse14 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-22 02:32:27,351 INFO L899 garLoopResultBuilder]: For program point L308-1(line 308) no Hoare annotation was computed. [2023-12-22 02:32:27,351 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 716 794) no Hoare annotation was computed. [2023-12-22 02:32:27,351 INFO L899 garLoopResultBuilder]: For program point L672-1(lines 661 684) no Hoare annotation was computed. [2023-12-22 02:32:27,351 INFO L899 garLoopResultBuilder]: For program point transmit3_returnLabel#1(lines 538 573) no Hoare annotation was computed. [2023-12-22 02:32:27,351 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 153 209) no Hoare annotation was computed. [2023-12-22 02:32:27,351 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 315) no Hoare annotation was computed. [2023-12-22 02:32:27,351 INFO L899 garLoopResultBuilder]: For program point transmit2_returnLabel#1(lines 502 537) no Hoare annotation was computed. [2023-12-22 02:32:27,352 INFO L899 garLoopResultBuilder]: For program point L542(lines 542 550) no Hoare annotation was computed. [2023-12-22 02:32:27,352 INFO L899 garLoopResultBuilder]: For program point L509(lines 509 513) no Hoare annotation was computed. [2023-12-22 02:32:27,352 INFO L895 garLoopResultBuilder]: At program point L443(line 443) the Hoare annotation is: (let ((.cse26 (= ~t2_st~0 (_ bv0 32))) (.cse27 (= ~t2_pc~0 (_ bv0 32))) (.cse25 (= ~t1_st~0 (_ bv0 32))) (.cse10 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~t3_pc~0 (_ bv0 32))) (.cse16 (= (_ bv0 32) ~m_pc~0)) (.cse28 (= ~t1_pc~0 (_ bv0 32))) (.cse30 (not (= ~t3_pc~0 (_ bv1 32)))) (.cse31 (not (= ~t2_pc~0 (_ bv1 32)))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse9 (= (_ bv1 32) ~t3_i~0)) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse14 (= ~p_last_write~0 ~c_last_read~0)) (.cse15 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= ~c_dr_pc~0 (_ bv0 32))) (.cse18 (= ~local~0 ~token~0)) (.cse19 (= ~t1_st~0 (_ bv2 32))) (.cse20 (= (_ bv2 32) ~E_3~0)) (.cse21 (= ~t1_pc~0 (_ bv1 32))) (.cse22 (= (_ bv1 32) ~t1_i~0)) (.cse23 (= ~c_dr_st~0 (_ bv0 32))) (.cse24 (= ~p_dw_pc~0 (_ bv0 32))) (.cse29 (= ~t3_st~0 (_ bv2 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse11 .cse13 .cse26 .cse14 .cse15 .cse27 .cse16 .cse17 .cse20 .cse22 .cse28 .cse23 .cse24 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse13 .cse26 .cse14 .cse15 .cse27 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse27 .cse16 .cse17 .cse20 .cse22 .cse28 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse22 .cse28 .cse23 .cse24 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse13 .cse26 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse31 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse22 .cse28 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse31 .cse13 .cse14 .cse15 .cse17 .cse19 .cse20 .cse22 .cse23 .cse24 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 (= (_ bv1 32) ~m_pc~0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse29))) [2023-12-22 02:32:27,352 INFO L899 garLoopResultBuilder]: For program point L443-1(line 443) no Hoare annotation was computed. [2023-12-22 02:32:27,352 INFO L899 garLoopResultBuilder]: For program point L1104(lines 1104 1110) no Hoare annotation was computed. [2023-12-22 02:32:27,352 INFO L895 garLoopResultBuilder]: At program point L1071(line 1071) the Hoare annotation is: (let ((.cse35 (= ~t2_pc~0 (_ bv1 32))) (.cse37 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse38 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse34 (not .cse37)) (.cse24 (= ~t1_pc~0 (_ bv0 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse27 (not .cse35)) (.cse14 (= (_ bv0 32) ~m_st~0)) (.cse19 (= (_ bv0 32) ~m_pc~0)) (.cse30 (= ~t1_st~0 (_ bv2 32))) (.cse31 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse9 (= ~t1_st~0 (_ bv0 32))) (.cse10 (= (_ bv1 32) ~t3_i~0)) (.cse11 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv0 32))) (.cse13 (= ~t3_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~T1_E~0)) (.cse28 (= ~t2_st~0 (_ bv0 32))) (.cse16 (= ~p_last_write~0 ~c_last_read~0)) (.cse17 (= ~p_dw_st~0 (_ bv0 32))) (.cse36 (= (_ bv1 32) ~m_pc~0)) (.cse33 (= ~t2_pc~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_1~0)) (.cse20 (= ~c_dr_pc~0 (_ bv0 32))) (.cse29 (= (_ bv2 32) ~m_st~0)) (.cse21 (= ~local~0 ~token~0)) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse32 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse25 (= ~c_dr_st~0 (_ bv0 32))) (.cse26 (= ~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 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse27 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31 .cse37) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26)))) [2023-12-22 02:32:27,352 INFO L899 garLoopResultBuilder]: For program point L1071-1(line 1071) no Hoare annotation was computed. [2023-12-22 02:32:27,353 INFO L895 garLoopResultBuilder]: At program point L774-1(lines 722 788) the Hoare annotation is: (let ((.cse35 (= ~t2_pc~0 (_ bv1 32))) (.cse37 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse38 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse34 (not .cse37)) (.cse24 (= ~t1_pc~0 (_ bv0 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse27 (not .cse35)) (.cse14 (= (_ bv0 32) ~m_st~0)) (.cse19 (= (_ bv0 32) ~m_pc~0)) (.cse30 (= ~t1_st~0 (_ bv2 32))) (.cse31 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse9 (= ~t1_st~0 (_ bv0 32))) (.cse10 (= (_ bv1 32) ~t3_i~0)) (.cse11 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv0 32))) (.cse13 (= ~t3_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~T1_E~0)) (.cse28 (= ~t2_st~0 (_ bv0 32))) (.cse16 (= ~p_last_write~0 ~c_last_read~0)) (.cse17 (= ~p_dw_st~0 (_ bv0 32))) (.cse36 (= (_ bv1 32) ~m_pc~0)) (.cse33 (= ~t2_pc~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_1~0)) (.cse20 (= ~c_dr_pc~0 (_ bv0 32))) (.cse29 (= (_ bv2 32) ~m_st~0)) (.cse21 (= ~local~0 ~token~0)) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse32 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse25 (= ~c_dr_st~0 (_ bv0 32))) (.cse26 (= ~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 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse27 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31 .cse37) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26)))) [2023-12-22 02:32:27,353 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 248 301) no Hoare annotation was computed. [2023-12-22 02:32:27,353 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2023-12-22 02:32:27,353 INFO L899 garLoopResultBuilder]: For program point L973-1(lines 957 1000) no Hoare annotation was computed. [2023-12-22 02:32:27,353 INFO L895 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse20 (= ~p_num_write~0 ~c_num_read~0)) (.cse21 (= ~q_free~0 (_ bv0 32))) (.cse9 (= ~p_dw_st~0 (_ bv2 32))) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= ~p_num_write~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= (_ bv2 32) ~T1_E~0)) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse18 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~E_1~0)) (.cse12 (= (_ bv0 32) ~m_pc~0)) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_3~0)) (.cse15 (= ~q_free~0 (_ bv1 32))) (.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 .cse6 .cse7 .cse8 .cse18 .cse11 .cse12 .cse14 .cse15 .cse19 .cse20) (and .cse13 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse21 .cse8 .cse9 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse14 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-22 02:32:27,353 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 218) no Hoare annotation was computed. [2023-12-22 02:32:27,353 INFO L899 garLoopResultBuilder]: For program point L214-2(lines 213 226) no Hoare annotation was computed. [2023-12-22 02:32:27,353 INFO L899 garLoopResultBuilder]: For program point L1106(lines 1106 1109) no Hoare annotation was computed. [2023-12-22 02:32:27,353 INFO L899 garLoopResultBuilder]: For program point L677-1(lines 658 685) no Hoare annotation was computed. [2023-12-22 02:32:27,353 INFO L899 garLoopResultBuilder]: For program point L545(lines 545 549) no Hoare annotation was computed. [2023-12-22 02:32:27,354 INFO L895 garLoopResultBuilder]: At program point L1041(line 1041) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T2_E~0) (= (_ bv2 32) ~T3_E~0) (= ~c_num_read~0 (_ bv0 32)) (= (_ bv1 32) ~t2_i~0) (= ~p_num_write~0 (_ bv0 32)) (= (_ bv2 32) ~E_2~0) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= (_ bv1 32) ~t3_i~0) (= ~t3_st~0 (_ bv0 32)) (= ~q_free~0 (_ bv0 32)) (= ~t3_pc~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~t2_st~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~t2_pc~0 (_ bv0 32)) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv2 32) ~E_3~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-22 02:32:27,354 INFO L899 garLoopResultBuilder]: For program point L1041-1(line 1041) no Hoare annotation was computed. [2023-12-22 02:32:27,354 INFO L899 garLoopResultBuilder]: For program point L777(lines 777 784) no Hoare annotation was computed. [2023-12-22 02:32:27,354 INFO L899 garLoopResultBuilder]: For program point L777-2(lines 777 784) no Hoare annotation was computed. [2023-12-22 02:32:27,354 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2023-12-22 02:32:27,354 INFO L895 garLoopResultBuilder]: At program point L481-1(lines 481 494) the Hoare annotation is: (let ((.cse31 (= ~t2_pc~0 (_ bv1 32)))) (let ((.cse27 (not .cse31)) (.cse24 (= ~t3_st~0 (_ bv0 32))) (.cse25 (= ~t3_pc~0 (_ bv0 32))) (.cse30 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse32 (= (_ bv1 32) ~m_pc~0)) (.cse33 (= ~t1_pc~0 (_ bv1 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse26 (= (_ bv2 32) ~m_st~0)) (.cse18 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse9 (= (_ bv1 32) ~t3_i~0)) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse28 (= ~t2_st~0 (_ bv0 32))) (.cse13 (= ~p_last_write~0 ~c_last_read~0)) (.cse14 (= ~p_dw_st~0 (_ bv0 32))) (.cse34 (= ~t2_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~E_1~0)) (.cse16 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~c_dr_pc~0 (_ bv0 32))) (.cse29 (not (= ~t3_pc~0 (_ bv1 32)))) (.cse19 (= (_ bv2 32) ~E_3~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse21 (= ~c_dr_st~0 (_ bv0 32))) (.cse22 (= ~p_dw_pc~0 (_ bv0 32))) (.cse23 (= ~t3_st~0 (_ bv2 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 .cse26 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse25 .cse12 .cse13 .cse14 .cse15 .cse17 .cse26 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse27 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse28 .cse13 .cse14 .cse15 .cse17 .cse26 .cse29 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse30 .cse31 .cse4 .cse5 .cse6 .cse7 .cse9 .cse24 .cse10 .cse25 .cse12 .cse28 .cse13 .cse14 .cse32 .cse15 .cse17 .cse26 .cse19 .cse33 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse24 .cse10 .cse25 .cse12 .cse28 .cse13 .cse14 .cse34 .cse15 .cse17 .cse26 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse28 .cse13 .cse14 .cse34 .cse15 .cse17 .cse26 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse27 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse24 .cse10 .cse25 .cse11 .cse12 .cse28 .cse13 .cse14 .cse34 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse30 .cse31 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse28 .cse13 .cse14 .cse32 .cse15 .cse17 .cse26 .cse19 .cse33 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14 .cse34 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14 .cse34 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20 .cse21 .cse22 .cse23)))) [2023-12-22 02:32:27,354 INFO L895 garLoopResultBuilder]: At program point L1043(line 1043) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse8 (= ~t1_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~M_E~0)) (.cse10 (= (_ bv1 32) ~t3_i~0)) (.cse11 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse14 (= ~t2_st~0 (_ bv0 32))) (.cse15 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse18 (= (_ bv0 32) ~m_pc~0)) (.cse19 (= ~c_dr_pc~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~E_3~0)) (.cse21 (= (_ bv1 32) ~t1_i~0)) (.cse22 (= ~c_dr_st~0 (_ bv0 32))) (.cse23 (= ~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 .cse18 .cse19 (= (_ bv2 32) ~m_st~0) .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~t3_pc~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) .cse13 .cse14 .cse15 .cse16 (= ~t2_pc~0 (_ bv0 32)) .cse17 .cse18 .cse19 (= ~local~0 ~token~0) .cse20 .cse21 (= ~t1_pc~0 (_ bv0 32)) .cse22 .cse23))) [2023-12-22 02:32:27,354 INFO L895 garLoopResultBuilder]: At program point L1043-1(line 1043) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse8 (= ~t1_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~M_E~0)) (.cse10 (= (_ bv1 32) ~t3_i~0)) (.cse11 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse14 (= ~t2_st~0 (_ bv0 32))) (.cse15 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse18 (= (_ bv0 32) ~m_pc~0)) (.cse19 (= ~c_dr_pc~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~E_3~0)) (.cse21 (= (_ bv1 32) ~t1_i~0)) (.cse22 (= ~c_dr_st~0 (_ bv0 32))) (.cse23 (= ~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 .cse18 .cse19 (= (_ bv2 32) ~m_st~0) .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~t3_pc~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) .cse13 .cse14 .cse15 .cse16 (= ~t2_pc~0 (_ bv0 32)) .cse17 .cse18 .cse19 (= ~local~0 ~token~0) .cse20 .cse21 (= ~t1_pc~0 (_ bv0 32)) .cse22 .cse23))) [2023-12-22 02:32:27,354 INFO L899 garLoopResultBuilder]: For program point L746-1(lines 722 788) no Hoare annotation was computed. [2023-12-22 02:32:27,354 INFO L899 garLoopResultBuilder]: For program point L317(lines 306 319) no Hoare annotation was computed. [2023-12-22 02:32:27,354 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2023-12-22 02:32:27,355 INFO L895 garLoopResultBuilder]: At program point L1044(line 1044) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse8 (= ~t1_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~M_E~0)) (.cse10 (= (_ bv1 32) ~t3_i~0)) (.cse11 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse14 (= ~t2_st~0 (_ bv0 32))) (.cse15 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse18 (= (_ bv0 32) ~m_pc~0)) (.cse19 (= ~c_dr_pc~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~E_3~0)) (.cse21 (= (_ bv1 32) ~t1_i~0)) (.cse22 (= ~c_dr_st~0 (_ bv0 32))) (.cse23 (= ~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 .cse18 .cse19 (= (_ bv2 32) ~m_st~0) .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~t3_pc~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) .cse13 .cse14 .cse15 .cse16 (= ~t2_pc~0 (_ bv0 32)) .cse17 .cse18 .cse19 (= ~local~0 ~token~0) .cse20 .cse21 (= ~t1_pc~0 (_ bv0 32)) .cse22 .cse23))) [2023-12-22 02:32:27,355 INFO L899 garLoopResultBuilder]: For program point L978-1(lines 957 1000) no Hoare annotation was computed. [2023-12-22 02:32:27,355 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 210 227) no Hoare annotation was computed. [2023-12-22 02:32:27,355 INFO L895 garLoopResultBuilder]: At program point L517-1(lines 517 530) the Hoare annotation is: (let ((.cse34 (= ~t3_pc~0 (_ bv1 32))) (.cse32 (= ~t2_pc~0 (_ bv1 32)))) (let ((.cse33 (= (_ bv1 32) ~m_pc~0)) (.cse21 (= ~local~0 ~token~0)) (.cse31 (= ~t1_pc~0 (_ bv1 32))) (.cse12 (not .cse32)) (.cse14 (= (_ bv0 32) ~m_st~0)) (.cse19 (= (_ bv0 32) ~m_pc~0)) (.cse28 (not .cse34)) (.cse30 (= ~t1_st~0 (_ bv2 32))) (.cse29 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse8 (= ~t1_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~t3_i~0)) (.cse10 (= ~t3_st~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse13 (= ~t3_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~T1_E~0)) (.cse16 (= ~p_last_write~0 ~c_last_read~0)) (.cse17 (= ~p_dw_st~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_1~0)) (.cse20 (= ~c_dr_pc~0 (_ bv0 32))) (.cse27 (= (_ bv2 32) ~m_st~0)) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse24 (= ~t1_pc~0 (_ bv0 32))) (.cse25 (= ~c_dr_st~0 (_ bv0 32))) (.cse26 (= ~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 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse27 .cse28 .cse22 .cse23 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse31 .cse23 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse27 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse32 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse15 .cse16 .cse17 .cse33 .cse18 .cse20 .cse27 .cse30 .cse22 .cse31 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse25 .cse26 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse15 .cse16 .cse17 .cse18 .cse20 .cse27 .cse30 .cse22 .cse23 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse31 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse22 .cse23 .cse24 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse15 .cse16 .cse17 .cse33 .cse18 .cse20 .cse27 .cse21 .cse22 .cse31 .cse23 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse15 .cse16 .cse17 .cse18 .cse20 .cse27 .cse22 .cse23 .cse24 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse33 .cse18 .cse20 .cse27 .cse21 .cse22 .cse31 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse30 .cse22 .cse23 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse27 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2023-12-22 02:32:27,355 INFO L895 garLoopResultBuilder]: At program point L451-1(lines 437 458) the Hoare annotation is: (let ((.cse29 (= ~local~0 ~token~0)) (.cse28 (= ~t1_pc~0 (_ bv1 32))) (.cse32 (not (= ~t2_pc~0 (_ bv1 32)))) (.cse25 (= ~t2_st~0 (_ bv2 32))) (.cse26 (not (= ~t3_pc~0 (_ bv1 32)))) (.cse27 (= ~t1_st~0 (_ bv2 32))) (.cse24 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse8 (= ~t1_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~t3_i~0)) (.cse30 (= ~t3_st~0 (_ bv0 32))) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse31 (= ~t3_pc~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~T1_E~0)) (.cse12 (= ~t2_st~0 (_ bv0 32))) (.cse13 (= ~p_last_write~0 ~c_last_read~0)) (.cse14 (= ~p_dw_st~0 (_ bv0 32))) (.cse15 (= ~t2_pc~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~E_1~0)) (.cse17 (= (_ bv0 32) ~m_pc~0)) (.cse18 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= (_ bv2 32) ~E_3~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse22 (= ~c_dr_st~0 (_ bv0 32))) (.cse23 (= ~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 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse26 .cse27 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse25 .cse9 .cse10 .cse11 .cse13 .cse14 (= (_ bv1 32) ~m_pc~0) .cse16 .cse18 .cse27 .cse19 .cse28 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse27 .cse19 .cse28 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse30 .cse10 .cse31 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse27 .cse19 .cse28 .cse20 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse30 .cse10 .cse31 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse29 .cse27 .cse19 .cse28 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse30 .cse10 .cse31 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse29 .cse27 .cse19 .cse28 .cse20 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse30 .cse10 .cse32 .cse31 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse27 .cse19 .cse20 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse10 .cse32 .cse11 .cse13 .cse14 .cse16 .cse18 .cse27 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse18 .cse26 .cse27 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse30 .cse10 .cse31 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23))) [2023-12-22 02:32:27,355 INFO L895 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) (= (_ bv2 32) ~T2_E~0) (= (_ bv2 32) ~T3_E~0) (= (_ bv2 32) ~E_2~0) (= (_ 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) (= (_ bv2 32) ~E_3~0) (= ~q_free~0 (_ bv1 32)) (= ~p_num_write~0 ~c_num_read~0)) [2023-12-22 02:32:27,355 INFO L899 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2023-12-22 02:32:27,355 INFO L899 garLoopResultBuilder]: For program point L749(lines 749 756) no Hoare annotation was computed. [2023-12-22 02:32:27,355 INFO L899 garLoopResultBuilder]: For program point L749-2(lines 749 756) no Hoare annotation was computed. [2023-12-22 02:32:27,355 INFO L899 garLoopResultBuilder]: For program point L1080(lines 1080 1084) no Hoare annotation was computed. [2023-12-22 02:32:27,356 INFO L895 garLoopResultBuilder]: At program point L1048-1(lines 1048 1085) the Hoare annotation is: (let ((.cse35 (= ~t2_pc~0 (_ bv1 32))) (.cse37 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse38 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse34 (not .cse37)) (.cse24 (= ~t1_pc~0 (_ bv0 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse27 (not .cse35)) (.cse14 (= (_ bv0 32) ~m_st~0)) (.cse19 (= (_ bv0 32) ~m_pc~0)) (.cse30 (= ~t1_st~0 (_ bv2 32))) (.cse31 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse9 (= ~t1_st~0 (_ bv0 32))) (.cse10 (= (_ bv1 32) ~t3_i~0)) (.cse11 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv0 32))) (.cse13 (= ~t3_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~T1_E~0)) (.cse28 (= ~t2_st~0 (_ bv0 32))) (.cse16 (= ~p_last_write~0 ~c_last_read~0)) (.cse17 (= ~p_dw_st~0 (_ bv0 32))) (.cse36 (= (_ bv1 32) ~m_pc~0)) (.cse33 (= ~t2_pc~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_1~0)) (.cse20 (= ~c_dr_pc~0 (_ bv0 32))) (.cse29 (= (_ bv2 32) ~m_st~0)) (.cse21 (= ~local~0 ~token~0)) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse32 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse25 (= ~c_dr_st~0 (_ bv0 32))) (.cse26 (= ~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 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse27 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31 .cse37) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26)))) [2023-12-22 02:32:27,356 INFO L895 garLoopResultBuilder]: At program point L553-1(lines 553 566) the Hoare annotation is: (let ((.cse34 (= ~t3_pc~0 (_ bv1 32))) (.cse33 (= ~t2_pc~0 (_ bv1 32)))) (let ((.cse20 (= ~t1_st~0 (_ bv2 32))) (.cse32 (= (_ bv1 32) ~m_pc~0)) (.cse22 (= ~t1_pc~0 (_ bv1 32))) (.cse29 (= (_ bv2 32) ~m_st~0)) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse31 (not .cse33)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse26 (= ~t1_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~t3_i~0)) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse27 (= ~t2_st~0 (_ bv0 32))) (.cse13 (= ~p_last_write~0 ~c_last_read~0)) (.cse14 (= ~p_dw_st~0 (_ bv0 32))) (.cse28 (= ~t2_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~E_1~0)) (.cse16 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~c_dr_pc~0 (_ bv0 32))) (.cse18 (not .cse34)) (.cse19 (= ~local~0 ~token~0)) (.cse21 (= (_ bv2 32) ~E_3~0)) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse30 (= ~t1_pc~0 (_ bv0 32))) (.cse24 (= ~c_dr_st~0 (_ bv0 32))) (.cse25 (= ~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 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse28 .cse15 .cse17 .cse29 .cse21 .cse23 .cse30 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse23 .cse30 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 .cse29 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse31 .cse12 .cse27 .cse13 .cse14 .cse15 .cse17 .cse29 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse32 .cse15 .cse17 .cse29 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse33 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse15 .cse17 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 .cse29 .cse21 .cse23 .cse30 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse31 .cse12 .cse13 .cse14 .cse15 .cse17 .cse29 .cse21 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse32 .cse28 .cse15 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse31 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse12 .cse13 .cse14 .cse32 .cse15 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse21 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse31 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 .cse23 .cse30 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse23 .cse30 .cse24 .cse25)))) [2023-12-22 02:32:27,356 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-22 02:32:27,356 INFO L895 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse20 (= ~p_num_write~0 ~c_num_read~0)) (.cse21 (= ~q_free~0 (_ bv0 32))) (.cse9 (= ~p_dw_st~0 (_ bv2 32))) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= ~p_num_write~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= (_ bv2 32) ~T1_E~0)) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse18 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~E_1~0)) (.cse12 (= (_ bv0 32) ~m_pc~0)) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_3~0)) (.cse15 (= ~q_free~0 (_ bv1 32))) (.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 .cse6 .cse7 .cse8 .cse18 .cse11 .cse12 .cse14 .cse15 .cse19 .cse20) (and .cse13 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse21 .cse8 .cse9 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse14 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-22 02:32:27,356 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2023-12-22 02:32:27,356 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2023-12-22 02:32:27,356 INFO L899 garLoopResultBuilder]: For program point L983-1(lines 957 1000) no Hoare annotation was computed. [2023-12-22 02:32:27,357 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2023-12-22 02:32:27,357 INFO L895 garLoopResultBuilder]: At program point L125-1(lines 125 145) the Hoare annotation is: (let ((.cse9 (= ~c_dr_pc~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv1 32))) (.cse13 (= (_ bv2 32) ~c_dr_st~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= (_ bv2 32) ~E_2~0)) (.cse5 (= (_ bv2 32) ~M_E~0)) (.cse14 (= ~q_free~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse10 (= (_ bv2 32) ~E_3~0)) (.cse12 (= ~c_dr_st~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) .cse4 .cse5 .cse6 (= ~p_last_write~0 ~c_last_read~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~p_dw_pc~0 (_ bv0 32))) (and .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 (= ~p_num_write~0 ~c_num_read~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse14 .cse6 .cse7 .cse8 .cse10 .cse12))) [2023-12-22 02:32:27,357 INFO L899 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2023-12-22 02:32:27,357 INFO L899 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2023-12-22 02:32:27,357 INFO L899 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2023-12-22 02:32:27,357 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 164) no Hoare annotation was computed. [2023-12-22 02:32:27,357 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 135) no Hoare annotation was computed. [2023-12-22 02:32:27,357 INFO L895 garLoopResultBuilder]: At program point L491(line 491) the Hoare annotation is: (let ((.cse25 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse26 (= (_ bv1 32) ~m_pc~0)) (.cse27 (= ~t1_pc~0 (_ bv1 32))) (.cse7 (= ~t2_st~0 (_ bv2 32))) (.cse21 (= ~t3_st~0 (_ bv0 32))) (.cse28 (not (= ~t2_pc~0 (_ bv1 32)))) (.cse22 (= ~t3_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= (_ bv2 32) ~T1_E~0)) (.cse23 (= ~t2_st~0 (_ bv0 32))) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~E_1~0)) (.cse14 (= ~c_dr_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~m_st~0)) (.cse16 (= (_ bv2 32) ~E_3~0)) (.cse17 (= (_ bv1 32) ~t1_i~0)) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse19 (= ~p_dw_pc~0 (_ bv0 32))) (.cse20 (= ~t3_st~0 (_ bv2 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= ~t3_pc~0 (_ bv1 32))) .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse21 .cse9 .cse22 .cse10 .cse23 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse22 .cse10 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= (_ bv0 32) ~m_pc~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse28 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) [2023-12-22 02:32:27,357 INFO L899 garLoopResultBuilder]: For program point L491-1(line 491) no Hoare annotation was computed. [2023-12-22 02:32:27,357 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2023-12-22 02:32:27,357 INFO L899 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2023-12-22 02:32:27,358 INFO L895 garLoopResultBuilder]: At program point L1020(line 1020) the Hoare annotation is: (let ((.cse35 (= ~t2_pc~0 (_ bv1 32))) (.cse37 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse38 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse34 (not .cse37)) (.cse24 (= ~t1_pc~0 (_ bv0 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse27 (not .cse35)) (.cse14 (= (_ bv0 32) ~m_st~0)) (.cse19 (= (_ bv0 32) ~m_pc~0)) (.cse30 (= ~t1_st~0 (_ bv2 32))) (.cse31 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse9 (= ~t1_st~0 (_ bv0 32))) (.cse10 (= (_ bv1 32) ~t3_i~0)) (.cse11 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv0 32))) (.cse13 (= ~t3_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~T1_E~0)) (.cse28 (= ~t2_st~0 (_ bv0 32))) (.cse16 (= ~p_last_write~0 ~c_last_read~0)) (.cse17 (= ~p_dw_st~0 (_ bv0 32))) (.cse36 (= (_ bv1 32) ~m_pc~0)) (.cse33 (= ~t2_pc~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_1~0)) (.cse20 (= ~c_dr_pc~0 (_ bv0 32))) (.cse29 (= (_ bv2 32) ~m_st~0)) (.cse21 (= ~local~0 ~token~0)) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse32 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse25 (= ~c_dr_st~0 (_ bv0 32))) (.cse26 (= ~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 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse27 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31 .cse37) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26)))) [2023-12-22 02:32:27,358 INFO L899 garLoopResultBuilder]: For program point L1020-1(line 1020) no Hoare annotation was computed. [2023-12-22 02:32:27,358 INFO L895 garLoopResultBuilder]: At program point L723(line 723) the Hoare annotation is: (let ((.cse35 (= ~t2_pc~0 (_ bv1 32))) (.cse37 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse38 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse34 (not .cse37)) (.cse24 (= ~t1_pc~0 (_ bv0 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse27 (not .cse35)) (.cse14 (= (_ bv0 32) ~m_st~0)) (.cse19 (= (_ bv0 32) ~m_pc~0)) (.cse30 (= ~t1_st~0 (_ bv2 32))) (.cse31 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse9 (= ~t1_st~0 (_ bv0 32))) (.cse10 (= (_ bv1 32) ~t3_i~0)) (.cse11 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv0 32))) (.cse13 (= ~t3_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~T1_E~0)) (.cse28 (= ~t2_st~0 (_ bv0 32))) (.cse16 (= ~p_last_write~0 ~c_last_read~0)) (.cse17 (= ~p_dw_st~0 (_ bv0 32))) (.cse36 (= (_ bv1 32) ~m_pc~0)) (.cse33 (= ~t2_pc~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_1~0)) (.cse20 (= ~c_dr_pc~0 (_ bv0 32))) (.cse29 (= (_ bv2 32) ~m_st~0)) (.cse21 (= ~local~0 ~token~0)) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse32 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse25 (= ~c_dr_st~0 (_ bv0 32))) (.cse26 (= ~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 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse27 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31 .cse37) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26)))) [2023-12-22 02:32:27,358 INFO L899 garLoopResultBuilder]: For program point L426(lines 426 434) no Hoare annotation was computed. [2023-12-22 02:32:27,358 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-22 02:32:27,358 INFO L895 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2023-12-22 02:32:27,358 INFO L899 garLoopResultBuilder]: For program point L988-1(lines 957 1000) no Hoare annotation was computed. [2023-12-22 02:32:27,359 INFO L899 garLoopResultBuilder]: For program point L1022(lines 1022 1027) no Hoare annotation was computed. [2023-12-22 02:32:27,359 INFO L899 garLoopResultBuilder]: For program point L725(line 725) no Hoare annotation was computed. [2023-12-22 02:32:27,359 INFO L895 garLoopResultBuilder]: At program point L527(line 527) the Hoare annotation is: (let ((.cse16 (= ~t1_st~0 (_ bv2 32))) (.cse20 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~E_1~0)) (.cse14 (= ~c_dr_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~m_st~0)) (.cse17 (= (_ bv1 32) ~t1_i~0)) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse19 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~t2_pc~0 (_ bv1 32)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (_ bv1 32) ~m_pc~0) .cse13 .cse14 .cse15 .cse16 (= ~t1_pc~0 (_ bv1 32)) .cse17 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~t3_st~0 (_ bv0 32)) .cse9 (= ~t3_pc~0 (_ bv0 32)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= ~t3_pc~0 (_ bv1 32))) .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= (_ bv0 32) ~m_pc~0) .cse14 .cse15 .cse17 .cse18 .cse19))) [2023-12-22 02:32:27,359 INFO L899 garLoopResultBuilder]: For program point L527-1(line 527) no Hoare annotation was computed. [2023-12-22 02:32:27,359 INFO L895 garLoopResultBuilder]: At program point L1056(line 1056) the Hoare annotation is: (let ((.cse35 (= ~t2_pc~0 (_ bv1 32))) (.cse37 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse38 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse34 (not .cse37)) (.cse24 (= ~t1_pc~0 (_ bv0 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse27 (not .cse35)) (.cse14 (= (_ bv0 32) ~m_st~0)) (.cse19 (= (_ bv0 32) ~m_pc~0)) (.cse30 (= ~t1_st~0 (_ bv2 32))) (.cse31 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse9 (= ~t1_st~0 (_ bv0 32))) (.cse10 (= (_ bv1 32) ~t3_i~0)) (.cse11 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv0 32))) (.cse13 (= ~t3_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~T1_E~0)) (.cse28 (= ~t2_st~0 (_ bv0 32))) (.cse16 (= ~p_last_write~0 ~c_last_read~0)) (.cse17 (= ~p_dw_st~0 (_ bv0 32))) (.cse36 (= (_ bv1 32) ~m_pc~0)) (.cse33 (= ~t2_pc~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_1~0)) (.cse20 (= ~c_dr_pc~0 (_ bv0 32))) (.cse29 (= (_ bv2 32) ~m_st~0)) (.cse21 (= ~local~0 ~token~0)) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse32 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse25 (= ~c_dr_st~0 (_ bv0 32))) (.cse26 (= ~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 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse27 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31 .cse37) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse34 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse20 .cse29 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse33 .cse18 .cse20 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse36 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse28 .cse16 .cse17 .cse36 .cse33 .cse18 .cse20 .cse29 .cse21 .cse22 .cse32 .cse23 .cse25 .cse26)))) [2023-12-22 02:32:27,359 INFO L899 garLoopResultBuilder]: For program point L1056-1(line 1056) no Hoare annotation was computed. [2023-12-22 02:32:27,359 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2023-12-22 02:32:27,359 INFO L899 garLoopResultBuilder]: For program point L429(lines 429 433) no Hoare annotation was computed. [2023-12-22 02:32:27,359 INFO L899 garLoopResultBuilder]: For program point $Ultimate##107(lines 451 457) no Hoare annotation was computed. [2023-12-22 02:32:27,360 INFO L899 garLoopResultBuilder]: For program point L958(lines 958 962) no Hoare annotation was computed. [2023-12-22 02:32:27,360 INFO L899 garLoopResultBuilder]: For program point L958-2(lines 957 1000) no Hoare annotation was computed. [2023-12-22 02:32:27,360 INFO L899 garLoopResultBuilder]: For program point L727(lines 727 731) no Hoare annotation was computed. [2023-12-22 02:32:27,360 INFO L899 garLoopResultBuilder]: For program point L760-1(lines 722 788) no Hoare annotation was computed. [2023-12-22 02:32:27,360 INFO L899 garLoopResultBuilder]: For program point L727-1(lines 722 788) no Hoare annotation was computed. [2023-12-22 02:32:27,360 INFO L899 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2023-12-22 02:32:27,360 INFO L895 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse20 (= ~p_num_write~0 ~c_num_read~0)) (.cse21 (= ~q_free~0 (_ bv0 32))) (.cse9 (= ~p_dw_st~0 (_ bv2 32))) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= ~p_num_write~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= (_ bv2 32) ~T1_E~0)) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse18 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~E_1~0)) (.cse12 (= (_ bv0 32) ~m_pc~0)) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_3~0)) (.cse15 (= ~q_free~0 (_ bv1 32))) (.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 .cse6 .cse7 .cse8 .cse18 .cse11 .cse12 .cse14 .cse15 .cse19 .cse20) (and .cse13 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse21 .cse8 .cse9 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse14 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-22 02:32:27,360 INFO L899 garLoopResultBuilder]: For program point L662(lines 662 666) no Hoare annotation was computed. [2023-12-22 02:32:27,360 INFO L899 garLoopResultBuilder]: For program point L662-2(lines 661 684) no Hoare annotation was computed. [2023-12-22 02:32:27,360 INFO L895 garLoopResultBuilder]: At program point L563(line 563) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~T2_E~0)) (.cse2 (= (_ bv2 32) ~T3_E~0)) (.cse3 (= ~c_num_read~0 (_ bv0 32))) (.cse4 (= (_ bv1 32) ~t2_i~0)) (.cse5 (= ~p_num_write~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= (_ bv1 32) ~t3_i~0)) (.cse8 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~T1_E~0)) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse11 (= ~p_dw_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~E_1~0)) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~m_st~0)) (.cse15 (= (_ bv2 32) ~E_3~0)) (.cse16 (= (_ bv1 32) ~t1_i~0)) (.cse17 (= ~c_dr_st~0 (_ bv0 32))) (.cse18 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= ~t2_pc~0 (_ bv1 32)) .cse3 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse4 .cse5 .cse6 (= ~t2_st~0 (_ bv2 32)) .cse7 .cse8 .cse9 .cse10 .cse11 (= (_ bv1 32) ~m_pc~0) .cse12 .cse13 .cse14 (= ~t1_st~0 (_ bv2 32)) .cse15 (= ~t1_pc~0 (_ bv1 32)) .cse16 .cse17 .cse18 (= ~t3_pc~0 (_ bv1 32))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (_ bv0 32) ~m_pc~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2023-12-22 02:32:27,360 INFO L899 garLoopResultBuilder]: For program point L563-1(line 563) no Hoare annotation was computed. [2023-12-22 02:32:27,360 INFO L895 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2023-12-22 02:32:27,360 INFO L895 garLoopResultBuilder]: At program point L200-1(lines 168 203) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= (_ bv2 32) ~E_2~0)) (.cse5 (= (_ bv2 32) ~M_E~0)) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~p_dw_st~0 (_ bv2 32))) (.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse8 (= (_ bv2 32) ~E_1~0)) (.cse9 (= (_ bv0 32) ~m_pc~0)) (.cse10 (= (_ bv2 32) ~E_3~0)) (.cse11 (= ~q_free~0 (_ bv1 32))) (.cse12 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~p_dw_st~0 (_ bv0 32)) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) (= ~q_free~0 (_ bv0 32)) .cse6 .cse13 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2023-12-22 02:32:27,360 INFO L899 garLoopResultBuilder]: For program point L244(lines 231 246) no Hoare annotation was computed. [2023-12-22 02:32:27,360 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 241) no Hoare annotation was computed. [2023-12-22 02:32:27,361 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 228 247) the Hoare annotation is: true [2023-12-22 02:32:27,361 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 242) no Hoare annotation was computed. [2023-12-22 02:32:27,361 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2023-12-22 02:32:27,361 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2023-12-22 02:32:27,361 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2023-12-22 02:32:27,361 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2023-12-22 02:32:27,361 INFO L899 garLoopResultBuilder]: For program point L702(lines 702 707) no Hoare annotation was computed. [2023-12-22 02:32:27,361 INFO L899 garLoopResultBuilder]: For program point L698(lines 698 708) no Hoare annotation was computed. [2023-12-22 02:32:27,361 INFO L899 garLoopResultBuilder]: For program point L694(lines 694 709) no Hoare annotation was computed. [2023-12-22 02:32:27,361 INFO L899 garLoopResultBuilder]: For program point L690(lines 690 710) no Hoare annotation was computed. [2023-12-22 02:32:27,361 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 686 715) the Hoare annotation is: true [2023-12-22 02:32:27,361 INFO L899 garLoopResultBuilder]: For program point L712(lines 689 714) no Hoare annotation was computed. [2023-12-22 02:32:27,361 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 686 715) no Hoare annotation was computed. [2023-12-22 02:32:27,361 INFO L899 garLoopResultBuilder]: For program point L857-1(lines 846 889) no Hoare annotation was computed. [2023-12-22 02:32:27,361 INFO L899 garLoopResultBuilder]: For program point L882-1(lines 843 890) no Hoare annotation was computed. [2023-12-22 02:32:27,361 INFO L899 garLoopResultBuilder]: For program point L847-1(lines 846 889) no Hoare annotation was computed. [2023-12-22 02:32:27,362 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 843 890) the Hoare annotation is: (let ((.cse37 (= ~t2_pc~0 (_ bv1 32)))) (let ((.cse31 (not (= ~t3_pc~0 (_ bv0 32)))) (.cse36 (= ~t3_pc~0 (_ bv1 32))) (.cse32 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse34 (not (= ~t1_st~0 (_ bv0 32)))) (.cse35 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse5 (not (= ~t2_st~0 (_ bv2 32)))) (.cse27 (not (= ~t3_st~0 (_ bv0 32)))) (.cse38 (not .cse37)) (.cse29 (not (= (_ bv1 32) ~m_pc~0))) (.cse30 (not (= (_ bv2 32) ~m_st~0))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not (= (_ bv0 32) ~m_st~0))) (.cse2 (not (= (_ bv2 32) |old(~E_M~0)|))) (.cse3 (and (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T2_E~0) (= (_ bv2 32) ~T3_E~0) (= (_ bv2 32) ~E_2~0) (= (_ bv2 32) ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (= (_ bv2 32) ~E_1~0) (= (_ bv2 32) ~E_3~0))) (.cse4 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse6 (not (= (_ bv2 32) |old(~E_1~0)|))) (.cse7 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse8 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse9 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse10 (not (= (_ bv1 32) ~t1_i~0))) (.cse11 (not (= (_ bv2 32) |old(~E_2~0)|))) (.cse33 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse12 (not (= ~local~0 ~token~0))) (.cse13 (not (= (_ bv0 32) ~m_pc~0))) (.cse14 (not (= ~q_free~0 (_ bv0 32)))) (.cse15 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse16 (not (= (_ bv2 32) |old(~E_3~0)|))) (.cse17 (not (= (_ bv2 32) |old(~T2_E~0)|))) (.cse18 (not (= (_ bv2 32) |old(~T1_E~0)|))) (.cse28 (not (= ~t2_st~0 (_ bv0 32)))) (.cse19 (not (= (_ bv1 32) ~t2_i~0))) (.cse20 (not (= ~t1_st~0 (_ bv2 32)))) (.cse21 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse22 (not (= ~t3_st~0 (_ bv2 32)))) (.cse23 (not (= (_ bv2 32) |old(~T3_E~0)|))) (.cse24 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (= (_ bv1 32) ~t3_i~0))) (.cse26 (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 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse19 .cse20 .cse30 .cse21 .cse31 .cse32 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse33 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse19 .cse21 .cse22 .cse35 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse37 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse37 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse31 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse21 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse35 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse33 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse19 .cse30 .cse21 .cse31 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse37 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse30 .cse21 .cse31 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse21 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse37 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse33 .cse12 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse29 .cse19 .cse30 .cse21 .cse31 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse33 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse19 .cse30 .cse21 .cse22 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse12 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse29 .cse19 .cse30 .cse21 .cse31 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse33 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse19 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse37 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse37 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse21 .cse31 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse31 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (bvadd ~local~0 (_ bv3 32)) ~token~0)) .cse14 .cse38 .cse15 .cse16 .cse17 .cse18 (not .cse36) .cse29 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse19 .cse21 .cse22 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse37 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse30 .cse21 .cse31 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse29 .cse19 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse37 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse21 .cse31 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse28 .cse19 .cse21 .cse31 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse29 .cse19 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse27 .cse10 .cse11 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse30 .cse21 .cse31 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse31 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse19 .cse20 .cse30 .cse21 .cse22 .cse32 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19 .cse30 .cse21 .cse22 .cse35 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse14 .cse38 .cse15 .cse16 .cse17 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32)))) .cse18 .cse29 .cse19 .cse20 .cse30 .cse21 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2023-12-22 02:32:27,362 INFO L899 garLoopResultBuilder]: For program point L872-1(lines 846 889) no Hoare annotation was computed. [2023-12-22 02:32:27,362 INFO L899 garLoopResultBuilder]: For program point L862-1(lines 846 889) no Hoare annotation was computed. [2023-12-22 02:32:27,362 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 843 890) no Hoare annotation was computed. [2023-12-22 02:32:27,362 INFO L899 garLoopResultBuilder]: For program point L852-1(lines 846 889) no Hoare annotation was computed. [2023-12-22 02:32:27,362 INFO L899 garLoopResultBuilder]: For program point L877-1(lines 846 889) no Hoare annotation was computed. [2023-12-22 02:32:27,362 INFO L899 garLoopResultBuilder]: For program point L867-1(lines 846 889) no Hoare annotation was computed. [2023-12-22 02:32:27,365 INFO L445 BasicCegarLoop]: Path program histogram: [3, 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] [2023-12-22 02:32:27,366 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 02:32:27,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 02:32:27 BoogieIcfgContainer [2023-12-22 02:32:27,434 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 02:32:27,434 INFO L158 Benchmark]: Toolchain (without parser) took 175185.68ms. Allocated memory was 267.4MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 222.5MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2023-12-22 02:32:27,434 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 207.6MB. Free memory is still 157.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 02:32:27,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.60ms. Allocated memory is still 267.4MB. Free memory was 221.9MB in the beginning and 203.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-22 02:32:27,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.52ms. Allocated memory is still 267.4MB. Free memory was 203.1MB in the beginning and 199.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-22 02:32:27,435 INFO L158 Benchmark]: Boogie Preprocessor took 56.00ms. Allocated memory is still 267.4MB. Free memory was 199.9MB in the beginning and 195.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-22 02:32:27,435 INFO L158 Benchmark]: RCFGBuilder took 613.21ms. Allocated memory is still 267.4MB. Free memory was 195.7MB in the beginning and 153.3MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2023-12-22 02:32:27,435 INFO L158 Benchmark]: TraceAbstraction took 174172.87ms. Allocated memory was 267.4MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 152.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2023-12-22 02:32:27,439 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 207.6MB. Free memory is still 157.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 296.60ms. Allocated memory is still 267.4MB. Free memory was 221.9MB in the beginning and 203.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.52ms. Allocated memory is still 267.4MB. Free memory was 203.1MB in the beginning and 199.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.00ms. Allocated memory is still 267.4MB. Free memory was 199.9MB in the beginning and 195.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 613.21ms. Allocated memory is still 267.4MB. Free memory was 195.7MB in the beginning and 153.3MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 174172.87ms. Allocated memory was 267.4MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 152.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.7GB. 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]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 27]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 204 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 174.1s, OverallIterations: 46, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 129.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9309 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9152 mSDsluCounter, 22632 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11806 mSDsCounter, 578 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5790 IncrementalHoareTripleChecker+Invalid, 6368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 578 mSolverCounterUnsat, 10826 mSDtfsCounter, 5790 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5954 GetRequests, 5859 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15450occurred in iteration=38, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.0s AutomataMinimizationTime, 46 MinimizatonAttempts, 889 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 41 LocationsWithAnnotation, 9385 PreInvPairs, 10616 NumberOfFragments, 55614 HoareAnnotationTreeSize, 9385 FormulaSimplifications, 3714 FormulaSimplificationTreeSizeReduction, 18.6s HoareSimplificationTime, 41 FormulaSimplificationsInter, 171957 FormulaSimplificationTreeSizeReductionInter, 110.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 5609 NumberOfCodeBlocks, 5580 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 5935 ConstructedInterpolants, 0 QuantifiedInterpolants, 10224 SizeOfPredicates, 8 NumberOfNonLiveVariables, 12030 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 49 InterpolantComputations, 45 PerfectInterpolantSequences, 3758/3943 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: 437]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2)) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (((local + 3) % 4294967296) == token)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 481]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2)) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (((local + 1) % 4294967296) == token)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (((local + 1) % 4294967296) == token)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) - InvariantResult [Line: 722]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (((local + 3) % 4294967296) == token)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2)) && (t3_pc == 1))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (token == ((local + 2) % 4294967296))) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (((local + 1) % 4294967296) == token)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (((local + 1) % 4294967296) == token)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 1048]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (((local + 3) % 4294967296) == token)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2)) && (t3_pc == 1))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (token == ((local + 2) % 4294967296))) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (((local + 1) % 4294967296) == token)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (((local + 1) % 4294967296) == token)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (p_num_write == c_num_read)) || (((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == E_2)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3))) || ((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (p_num_write == c_num_read))) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (p_num_write == 0)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (q_free == 1)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || ((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read))) || ((c_dr_pc == 0) && (2 == c_dr_st))) || ((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == E_2)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (c_dr_st == 0))) || ((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read))) || (((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == E_2)) && (2 == M_E)) && (q_free == 0)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (2 == c_dr_st))) || ((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (p_num_write == 0)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (q_free == 1)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (p_num_write == 0)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (q_free == 1)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || ((c_dr_pc == 0) && (2 == c_dr_st))) || (((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == E_2)) && (2 == M_E)) && (q_free == 0)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (2 == c_dr_st))) || (((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == E_2)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (c_dr_st == 0))) - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (token == ((local + 2) % 4294967296))) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_pc == 1))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (((local + 1) % 4294967296) == token)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (((local + 3) % 4294967296) == token)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_pc == 1))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && !((t3_pc == 1))) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (p_num_write == 0)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (q_free == 1)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || ((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read))) || ((c_dr_pc == 0) && (2 == c_dr_st))) || ((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == E_2)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (c_dr_st == 0))) || ((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read))) || (((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == E_2)) && (2 == M_E)) && (q_free == 0)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (2 == c_dr_st))) || ((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (p_num_write == 0)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (q_free == 1)) && (c_dr_st == 0)) && (p_dw_pc == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-22 02:32:27,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...