/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.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 02:28:59,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 02:28:59,159 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:28:59,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 02:28:59,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 02:28:59,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 02:28:59,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 02:28:59,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 02:28:59,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 02:28:59,192 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 02:28:59,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 02:28:59,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 02:28:59,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 02:28:59,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 02:28:59,194 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 02:28:59,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 02:28:59,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 02:28:59,195 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 02:28:59,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 02:28:59,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 02:28:59,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 02:28:59,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 02:28:59,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 02:28:59,196 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 02:28:59,196 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 02:28:59,196 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 02:28:59,196 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 02:28:59,196 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 02:28:59,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 02:28:59,197 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 02:28:59,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 02:28:59,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 02:28:59,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 02:28:59,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 02:28:59,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:28:59,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 02:28:59,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 02:28:59,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 02:28:59,198 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 02:28:59,198 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 02:28:59,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 02:28:59,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 02:28:59,199 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 02:28:59,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 02:28:59,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 02:28:59,199 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 02:28:59,199 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:28:59,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 02:28:59,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 02:28:59,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 02:28:59,459 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 02:28:59,460 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 02:28:59,461 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.02.cil-1.c [2023-12-22 02:29:00,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 02:29:00,636 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 02:29:00,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2023-12-22 02:29:00,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ef74f2f/117feec6d1ef4e559f9041e81929bea3/FLAGc1b8b9437 [2023-12-22 02:29:00,663 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ef74f2f/117feec6d1ef4e559f9041e81929bea3 [2023-12-22 02:29:00,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 02:29:00,666 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 02:29:00,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 02:29:00,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 02:29:00,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 02:29:00,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:29:00" (1/1) ... [2023-12-22 02:29:00,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d53956d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:00, skipping insertion in model container [2023-12-22 02:29:00,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:29:00" (1/1) ... [2023-12-22 02:29:00,712 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 02:29:00,834 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.02.cil-1.c[913,926] [2023-12-22 02:29:00,887 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.02.cil-1.c[5977,5990] [2023-12-22 02:29:00,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:29:00,936 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 02:29:00,947 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.02.cil-1.c[913,926] [2023-12-22 02:29:00,961 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.02.cil-1.c[5977,5990] [2023-12-22 02:29:00,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:29:00,997 INFO L206 MainTranslator]: Completed translation [2023-12-22 02:29:00,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:00 WrapperNode [2023-12-22 02:29:00,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 02:29:00,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 02:29:00,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 02:29:00,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 02:29:01,004 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:00" (1/1) ... [2023-12-22 02:29:01,021 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:00" (1/1) ... [2023-12-22 02:29:01,046 INFO L138 Inliner]: procedures = 53, calls = 54, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 462 [2023-12-22 02:29:01,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 02:29:01,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 02:29:01,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 02:29:01,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 02:29:01,057 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:00" (1/1) ... [2023-12-22 02:29:01,057 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:00" (1/1) ... [2023-12-22 02:29:01,060 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:00" (1/1) ... [2023-12-22 02:29:01,072 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:01,072 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:00" (1/1) ... [2023-12-22 02:29:01,073 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:00" (1/1) ... [2023-12-22 02:29:01,079 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:00" (1/1) ... [2023-12-22 02:29:01,088 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:00" (1/1) ... [2023-12-22 02:29:01,090 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:00" (1/1) ... [2023-12-22 02:29:01,091 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:00" (1/1) ... [2023-12-22 02:29:01,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 02:29:01,104 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 02:29:01,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 02:29:01,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 02:29:01,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:00" (1/1) ... [2023-12-22 02:29:01,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:29:01,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 02:29:01,131 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:01,153 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:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 02:29:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-22 02:29:01,163 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-22 02:29:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2023-12-22 02:29:01,163 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2023-12-22 02:29:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-22 02:29:01,163 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-22 02:29:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-22 02:29:01,164 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-22 02:29:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-22 02:29:01,164 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-22 02:29:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-22 02:29:01,164 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-22 02:29:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 02:29:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-22 02:29:01,164 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-22 02:29:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-22 02:29:01,165 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-22 02:29:01,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 02:29:01,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 02:29:01,165 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-22 02:29:01,165 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-22 02:29:01,245 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 02:29:01,248 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 02:29:01,638 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 02:29:01,673 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 02:29:01,673 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-12-22 02:29:01,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:29:01 BoogieIcfgContainer [2023-12-22 02:29:01,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 02:29:01,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 02:29:01,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 02:29:01,679 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 02:29:01,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 02:29:00" (1/3) ... [2023-12-22 02:29:01,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6b20cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:29:01, skipping insertion in model container [2023-12-22 02:29:01,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:29:00" (2/3) ... [2023-12-22 02:29:01,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6b20cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:29:01, skipping insertion in model container [2023-12-22 02:29:01,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:29:01" (3/3) ... [2023-12-22 02:29:01,684 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2023-12-22 02:29:01,697 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 02:29:01,697 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-22 02:29:01,742 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 02:29:01,747 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;@3cf47fc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 02:29:01,747 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-22 02:29:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 147 states have (on average 1.653061224489796) internal successors, (243), 152 states have internal predecessors, (243), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-22 02:29:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-22 02:29:01,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:01,759 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:01,759 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:01,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:01,763 INFO L85 PathProgramCache]: Analyzing trace with hash -641686583, now seen corresponding path program 1 times [2023-12-22 02:29:01,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:01,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411944311] [2023-12-22 02:29:01,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:01,772 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:01,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:01,773 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:01,775 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:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:01,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:01,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:01,953 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:01,954 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:01,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:01,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411944311] [2023-12-22 02:29:01,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411944311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:01,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:01,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:01,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933791426] [2023-12-22 02:29:01,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:01,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:01,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:01,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:01,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:01,987 INFO L87 Difference]: Start difference. First operand has 181 states, 147 states have (on average 1.653061224489796) internal successors, (243), 152 states have internal predecessors, (243), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) 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:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:02,140 INFO L93 Difference]: Finished difference Result 403 states and 643 transitions. [2023-12-22 02:29:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:02,143 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:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:02,158 INFO L225 Difference]: With dead ends: 403 [2023-12-22 02:29:02,158 INFO L226 Difference]: Without dead ends: 229 [2023-12-22 02:29:02,165 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:02,170 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 242 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:02,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 322 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-22 02:29:02,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2023-12-22 02:29:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 187 states have (on average 1.4866310160427807) internal successors, (278), 190 states have internal predecessors, (278), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2023-12-22 02:29:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 332 transitions. [2023-12-22 02:29:02,235 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 332 transitions. Word has length 37 [2023-12-22 02:29:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:02,236 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 332 transitions. [2023-12-22 02:29:02,236 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:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 332 transitions. [2023-12-22 02:29:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-22 02:29:02,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:02,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] [2023-12-22 02:29:02,250 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:02,445 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:02,446 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:02,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:02,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1102259478, now seen corresponding path program 1 times [2023-12-22 02:29:02,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:02,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623854536] [2023-12-22 02:29:02,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:02,448 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:02,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:02,450 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:02,475 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:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:02,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:02,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:02,555 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:02,556 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:02,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:02,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623854536] [2023-12-22 02:29:02,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623854536] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:02,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:02,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:02,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167153313] [2023-12-22 02:29:02,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:02,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:02,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:02,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:02,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:02,558 INFO L87 Difference]: Start difference. First operand 225 states and 332 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:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:02,609 INFO L93 Difference]: Finished difference Result 425 states and 624 transitions. [2023-12-22 02:29:02,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:02,609 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:02,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:02,611 INFO L225 Difference]: With dead ends: 425 [2023-12-22 02:29:02,612 INFO L226 Difference]: Without dead ends: 322 [2023-12-22 02:29:02,612 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:02,613 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 234 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:02,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 304 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:02,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-12-22 02:29:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 318. [2023-12-22 02:29:02,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 268 states have (on average 1.4514925373134329) internal successors, (389), 271 states have internal predecessors, (389), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (40), 32 states have call predecessors, (40), 32 states have call successors, (40) [2023-12-22 02:29:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 463 transitions. [2023-12-22 02:29:02,654 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 463 transitions. Word has length 38 [2023-12-22 02:29:02,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:02,654 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 463 transitions. [2023-12-22 02:29:02,654 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:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 463 transitions. [2023-12-22 02:29:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-22 02:29:02,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:02,656 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:02,661 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:02,858 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:02,859 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:02,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:02,859 INFO L85 PathProgramCache]: Analyzing trace with hash -45404508, now seen corresponding path program 1 times [2023-12-22 02:29:02,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:02,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738847826] [2023-12-22 02:29:02,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:02,860 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:02,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:02,861 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:02,867 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:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:02,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:02,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:02,974 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:02,974 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:02,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:02,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738847826] [2023-12-22 02:29:02,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738847826] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:02,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:02,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:02,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451088820] [2023-12-22 02:29:02,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:02,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:02,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:02,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:02,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:02,977 INFO L87 Difference]: Start difference. First operand 318 states and 463 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:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:03,048 INFO L93 Difference]: Finished difference Result 670 states and 960 transitions. [2023-12-22 02:29:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:03,048 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:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:03,053 INFO L225 Difference]: With dead ends: 670 [2023-12-22 02:29:03,053 INFO L226 Difference]: Without dead ends: 474 [2023-12-22 02:29:03,054 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:03,056 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 58 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:03,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 476 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2023-12-22 02:29:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 423. [2023-12-22 02:29:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 361 states have (on average 1.4349030470914128) internal successors, (518), 366 states have internal predecessors, (518), 40 states have call successors, (40), 21 states have call predecessors, (40), 20 states have return successors, (48), 36 states have call predecessors, (48), 38 states have call successors, (48) [2023-12-22 02:29:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 606 transitions. [2023-12-22 02:29:03,087 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 606 transitions. Word has length 39 [2023-12-22 02:29:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:03,087 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 606 transitions. [2023-12-22 02:29:03,087 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:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 606 transitions. [2023-12-22 02:29:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-22 02:29:03,089 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:03,090 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:03,094 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:03,294 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:03,297 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:03,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:03,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1197660736, now seen corresponding path program 1 times [2023-12-22 02:29:03,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:03,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349778762] [2023-12-22 02:29:03,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:03,298 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:03,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:03,299 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:03,300 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:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:03,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:03,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:03,393 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:03,393 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:03,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:03,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349778762] [2023-12-22 02:29:03,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349778762] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:03,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:03,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:03,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935137324] [2023-12-22 02:29:03,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:03,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:03,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:03,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:03,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:03,400 INFO L87 Difference]: Start difference. First operand 423 states and 606 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:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:03,476 INFO L93 Difference]: Finished difference Result 875 states and 1243 transitions. [2023-12-22 02:29:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:03,477 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:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:03,480 INFO L225 Difference]: With dead ends: 875 [2023-12-22 02:29:03,480 INFO L226 Difference]: Without dead ends: 574 [2023-12-22 02:29:03,481 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:03,481 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 46 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 517 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.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:03,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 517 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2023-12-22 02:29:03,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2023-12-22 02:29:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 490 states have (on average 1.3816326530612244) internal successors, (677), 495 states have internal predecessors, (677), 54 states have call successors, (54), 29 states have call predecessors, (54), 28 states have return successors, (70), 50 states have call predecessors, (70), 52 states have call successors, (70) [2023-12-22 02:29:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 801 transitions. [2023-12-22 02:29:03,519 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 801 transitions. Word has length 54 [2023-12-22 02:29:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:03,521 INFO L495 AbstractCegarLoop]: Abstraction has 574 states and 801 transitions. [2023-12-22 02:29:03,521 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:03,521 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 801 transitions. [2023-12-22 02:29:03,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-22 02:29:03,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:03,523 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:03,529 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:03,726 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:03,727 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:03,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:03,727 INFO L85 PathProgramCache]: Analyzing trace with hash 119218933, now seen corresponding path program 1 times [2023-12-22 02:29:03,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:03,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141209109] [2023-12-22 02:29:03,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:03,728 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:03,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:03,729 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:03,731 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:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:03,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:03,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:03,818 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:03,819 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:03,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:03,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141209109] [2023-12-22 02:29:03,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141209109] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:03,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:03,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:03,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257875752] [2023-12-22 02:29:03,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:03,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:03,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:03,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:03,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:03,821 INFO L87 Difference]: Start difference. First operand 574 states and 801 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:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:03,909 INFO L93 Difference]: Finished difference Result 1059 states and 1460 transitions. [2023-12-22 02:29:03,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:03,910 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:03,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:03,913 INFO L225 Difference]: With dead ends: 1059 [2023-12-22 02:29:03,913 INFO L226 Difference]: Without dead ends: 687 [2023-12-22 02:29:03,914 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:03,915 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 221 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:03,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 308 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-12-22 02:29:03,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2023-12-22 02:29:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 589 states have (on average 1.3497453310696095) internal successors, (795), 594 states have internal predecessors, (795), 62 states have call successors, (62), 35 states have call predecessors, (62), 34 states have return successors, (82), 58 states have call predecessors, (82), 60 states have call successors, (82) [2023-12-22 02:29:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 939 transitions. [2023-12-22 02:29:03,944 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 939 transitions. Word has length 59 [2023-12-22 02:29:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:03,944 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 939 transitions. [2023-12-22 02:29:03,944 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:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 939 transitions. [2023-12-22 02:29:03,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-22 02:29:03,946 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:03,946 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:03,952 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:04,149 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:04,150 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:04,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:04,150 INFO L85 PathProgramCache]: Analyzing trace with hash 157658772, now seen corresponding path program 1 times [2023-12-22 02:29:04,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:04,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60428305] [2023-12-22 02:29:04,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:04,151 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:04,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:04,152 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:04,160 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:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:04,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:04,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:04,252 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:04,252 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:04,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:04,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60428305] [2023-12-22 02:29:04,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60428305] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:04,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:04,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:04,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323727882] [2023-12-22 02:29:04,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:04,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:04,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:04,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:04,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:04,254 INFO L87 Difference]: Start difference. First operand 687 states and 939 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:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:04,340 INFO L93 Difference]: Finished difference Result 1186 states and 1628 transitions. [2023-12-22 02:29:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:04,340 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:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:04,343 INFO L225 Difference]: With dead ends: 1186 [2023-12-22 02:29:04,343 INFO L226 Difference]: Without dead ends: 748 [2023-12-22 02:29:04,344 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:04,345 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 11 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:04,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 712 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2023-12-22 02:29:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 718. [2023-12-22 02:29:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 618 states have (on average 1.3333333333333333) internal successors, (824), 625 states have internal predecessors, (824), 62 states have call successors, (62), 35 states have call predecessors, (62), 36 states have return successors, (84), 58 states have call predecessors, (84), 60 states have call successors, (84) [2023-12-22 02:29:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 970 transitions. [2023-12-22 02:29:04,384 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 970 transitions. Word has length 60 [2023-12-22 02:29:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:04,385 INFO L495 AbstractCegarLoop]: Abstraction has 718 states and 970 transitions. [2023-12-22 02:29:04,385 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:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 970 transitions. [2023-12-22 02:29:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-22 02:29:04,386 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:04,386 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:04,391 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 (7)] Ended with exit code 0 [2023-12-22 02:29:04,589 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:04,589 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:04,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:04,590 INFO L85 PathProgramCache]: Analyzing trace with hash -686346730, now seen corresponding path program 1 times [2023-12-22 02:29:04,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:04,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964258752] [2023-12-22 02:29:04,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:04,590 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:04,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:04,591 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:04,594 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:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:04,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:04,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:04,664 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:04,664 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:04,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:04,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964258752] [2023-12-22 02:29:04,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964258752] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:04,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:04,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:04,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009176103] [2023-12-22 02:29:04,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:04,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:04,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:04,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:04,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:04,666 INFO L87 Difference]: Start difference. First operand 718 states and 970 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:04,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:04,736 INFO L93 Difference]: Finished difference Result 1135 states and 1539 transitions. [2023-12-22 02:29:04,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:04,736 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:04,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:04,738 INFO L225 Difference]: With dead ends: 1135 [2023-12-22 02:29:04,738 INFO L226 Difference]: Without dead ends: 625 [2023-12-22 02:29:04,739 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:04,740 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 2 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:04,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 709 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:04,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2023-12-22 02:29:04,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 619. [2023-12-22 02:29:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 533 states have (on average 1.3302063789868668) internal successors, (709), 542 states have internal predecessors, (709), 52 states have call successors, (52), 29 states have call predecessors, (52), 32 states have return successors, (70), 48 states have call predecessors, (70), 50 states have call successors, (70) [2023-12-22 02:29:04,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 831 transitions. [2023-12-22 02:29:04,765 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 831 transitions. Word has length 60 [2023-12-22 02:29:04,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:04,766 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 831 transitions. [2023-12-22 02:29:04,766 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:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 831 transitions. [2023-12-22 02:29:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-22 02:29:04,767 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:04,768 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:04,773 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 (8)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:04,971 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:04,971 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:04,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:04,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1111292886, now seen corresponding path program 1 times [2023-12-22 02:29:04,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:04,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830833654] [2023-12-22 02:29:04,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:04,972 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:04,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:04,973 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:04,977 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:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:05,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:05,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:05,110 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:05,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:29:05,145 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:05,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:05,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830833654] [2023-12-22 02:29:05,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830833654] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 02:29:05,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 02:29:05,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-12-22 02:29:05,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898034954] [2023-12-22 02:29:05,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:05,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:05,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:05,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:05,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:05,147 INFO L87 Difference]: Start difference. First operand 619 states and 831 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:05,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:05,271 INFO L93 Difference]: Finished difference Result 668 states and 892 transitions. [2023-12-22 02:29:05,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:05,272 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:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:05,274 INFO L225 Difference]: With dead ends: 668 [2023-12-22 02:29:05,275 INFO L226 Difference]: Without dead ends: 665 [2023-12-22 02:29:05,275 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:05,275 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 441 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:05,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 310 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-12-22 02:29:05,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 618. [2023-12-22 02:29:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 533 states have (on average 1.326454033771107) internal successors, (707), 541 states have internal predecessors, (707), 51 states have call successors, (51), 29 states have call predecessors, (51), 32 states have return successors, (70), 48 states have call predecessors, (70), 50 states have call successors, (70) [2023-12-22 02:29:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 828 transitions. [2023-12-22 02:29:05,302 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 828 transitions. Word has length 60 [2023-12-22 02:29:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:05,302 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 828 transitions. [2023-12-22 02:29:05,302 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:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 828 transitions. [2023-12-22 02:29:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:29:05,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:05,313 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] [2023-12-22 02:29:05,318 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:05,516 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:05,516 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:05,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:05,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1127040550, now seen corresponding path program 1 times [2023-12-22 02:29:05,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:05,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155291561] [2023-12-22 02:29:05,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:05,517 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:05,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:05,519 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:05,541 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:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:05,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:05,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:05,608 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:05,608 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:05,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:05,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155291561] [2023-12-22 02:29:05,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155291561] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:05,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:05,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:05,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609535409] [2023-12-22 02:29:05,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:05,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:05,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:05,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:05,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:05,610 INFO L87 Difference]: Start difference. First operand 618 states and 828 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 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:05,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:05,916 INFO L93 Difference]: Finished difference Result 843 states and 1169 transitions. [2023-12-22 02:29:05,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:29:05,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 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 61 [2023-12-22 02:29:05,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:05,919 INFO L225 Difference]: With dead ends: 843 [2023-12-22 02:29:05,920 INFO L226 Difference]: Without dead ends: 735 [2023-12-22 02:29:05,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 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:05,921 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 388 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:05,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 552 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:29:05,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2023-12-22 02:29:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 726. [2023-12-22 02:29:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 623 states have (on average 1.3563402889245586) internal successors, (845), 632 states have internal predecessors, (845), 62 states have call successors, (62), 35 states have call predecessors, (62), 39 states have return successors, (82), 59 states have call predecessors, (82), 61 states have call successors, (82) [2023-12-22 02:29:05,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 989 transitions. [2023-12-22 02:29:05,954 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 989 transitions. Word has length 61 [2023-12-22 02:29:05,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:05,954 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 989 transitions. [2023-12-22 02:29:05,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 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:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 989 transitions. [2023-12-22 02:29:05,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:29:05,955 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:05,955 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] [2023-12-22 02:29:05,961 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:06,158 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:06,159 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:06,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:06,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1159478042, now seen corresponding path program 1 times [2023-12-22 02:29:06,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:06,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817206171] [2023-12-22 02:29:06,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:06,159 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:06,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:06,160 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:06,162 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:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:06,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:06,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:06,246 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:06,246 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:06,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:06,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817206171] [2023-12-22 02:29:06,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817206171] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:06,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:06,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:06,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760559761] [2023-12-22 02:29:06,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:06,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:06,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:06,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:06,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:06,248 INFO L87 Difference]: Start difference. First operand 726 states and 989 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:06,483 INFO L93 Difference]: Finished difference Result 942 states and 1318 transitions. [2023-12-22 02:29:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:06,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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 61 [2023-12-22 02:29:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:06,486 INFO L225 Difference]: With dead ends: 942 [2023-12-22 02:29:06,486 INFO L226 Difference]: Without dead ends: 726 [2023-12-22 02:29:06,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 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:06,488 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 311 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:06,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 394 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2023-12-22 02:29:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2023-12-22 02:29:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 623 states have (on average 1.3451043338683788) internal successors, (838), 632 states have internal predecessors, (838), 62 states have call successors, (62), 35 states have call predecessors, (62), 39 states have return successors, (82), 59 states have call predecessors, (82), 61 states have call successors, (82) [2023-12-22 02:29:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 982 transitions. [2023-12-22 02:29:06,528 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 982 transitions. Word has length 61 [2023-12-22 02:29:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:06,528 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 982 transitions. [2023-12-22 02:29:06,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 982 transitions. [2023-12-22 02:29:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:29:06,530 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:06,530 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] [2023-12-22 02:29:06,535 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:06,736 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:06,736 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:06,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:06,737 INFO L85 PathProgramCache]: Analyzing trace with hash -956142042, now seen corresponding path program 1 times [2023-12-22 02:29:06,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:06,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996329428] [2023-12-22 02:29:06,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:06,737 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:06,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:06,739 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:06,741 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:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:06,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:06,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:06,866 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:06,866 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:06,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:06,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996329428] [2023-12-22 02:29:06,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996329428] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:06,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:06,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:06,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513143812] [2023-12-22 02:29:06,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:06,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:06,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:06,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:06,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:06,868 INFO L87 Difference]: Start difference. First operand 726 states and 982 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:07,145 INFO L93 Difference]: Finished difference Result 988 states and 1376 transitions. [2023-12-22 02:29:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:07,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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 61 [2023-12-22 02:29:07,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:07,149 INFO L225 Difference]: With dead ends: 988 [2023-12-22 02:29:07,149 INFO L226 Difference]: Without dead ends: 772 [2023-12-22 02:29:07,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 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:07,150 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 328 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:07,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 388 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:07,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2023-12-22 02:29:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2023-12-22 02:29:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 663 states have (on average 1.3378582202111613) internal successors, (887), 672 states have internal predecessors, (887), 64 states have call successors, (64), 39 states have call predecessors, (64), 43 states have return successors, (84), 61 states have call predecessors, (84), 63 states have call successors, (84) [2023-12-22 02:29:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1035 transitions. [2023-12-22 02:29:07,191 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1035 transitions. Word has length 61 [2023-12-22 02:29:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:07,191 INFO L495 AbstractCegarLoop]: Abstraction has 772 states and 1035 transitions. [2023-12-22 02:29:07,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1035 transitions. [2023-12-22 02:29:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:29:07,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:07,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:07,196 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:07,396 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:07,396 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:07,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:07,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2126878874, now seen corresponding path program 1 times [2023-12-22 02:29:07,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:07,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007241586] [2023-12-22 02:29:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:07,397 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:07,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:07,399 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:07,400 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:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:07,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:07,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:07,506 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:07,507 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:07,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:07,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007241586] [2023-12-22 02:29:07,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007241586] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:07,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:07,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:07,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019145698] [2023-12-22 02:29:07,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:07,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:07,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:07,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:07,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:07,508 INFO L87 Difference]: Start difference. First operand 772 states and 1035 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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:07,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:07,752 INFO L93 Difference]: Finished difference Result 1080 states and 1482 transitions. [2023-12-22 02:29:07,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:07,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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 61 [2023-12-22 02:29:07,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:07,755 INFO L225 Difference]: With dead ends: 1080 [2023-12-22 02:29:07,755 INFO L226 Difference]: Without dead ends: 818 [2023-12-22 02:29:07,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 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:07,756 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 321 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:07,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 381 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:07,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2023-12-22 02:29:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2023-12-22 02:29:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 703 states have (on average 1.32574679943101) internal successors, (932), 712 states have internal predecessors, (932), 66 states have call successors, (66), 43 states have call predecessors, (66), 47 states have return successors, (86), 63 states have call predecessors, (86), 65 states have call successors, (86) [2023-12-22 02:29:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1084 transitions. [2023-12-22 02:29:07,805 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1084 transitions. Word has length 61 [2023-12-22 02:29:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:07,805 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1084 transitions. [2023-12-22 02:29:07,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1084 transitions. [2023-12-22 02:29:07,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:29:07,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:07,827 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] [2023-12-22 02:29:07,852 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 (13)] Ended with exit code 0 [2023-12-22 02:29:08,036 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:08,036 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:08,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:08,037 INFO L85 PathProgramCache]: Analyzing trace with hash -836100825, now seen corresponding path program 1 times [2023-12-22 02:29:08,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:08,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637208807] [2023-12-22 02:29:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:08,037 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:08,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:08,038 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:08,039 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:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:08,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:08,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:08,119 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:08,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:08,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:08,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637208807] [2023-12-22 02:29:08,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637208807] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:08,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:08,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:08,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630089478] [2023-12-22 02:29:08,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:08,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:08,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:08,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:08,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:08,122 INFO L87 Difference]: Start difference. First operand 818 states and 1084 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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:08,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:08,339 INFO L93 Difference]: Finished difference Result 1166 states and 1572 transitions. [2023-12-22 02:29:08,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:08,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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 61 [2023-12-22 02:29:08,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:08,342 INFO L225 Difference]: With dead ends: 1166 [2023-12-22 02:29:08,342 INFO L226 Difference]: Without dead ends: 858 [2023-12-22 02:29:08,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 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:08,344 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 315 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:08,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 374 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2023-12-22 02:29:08,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2023-12-22 02:29:08,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 741 states have (on average 1.310391363022942) internal successors, (971), 750 states have internal predecessors, (971), 66 states have call successors, (66), 45 states have call predecessors, (66), 49 states have return successors, (86), 63 states have call predecessors, (86), 65 states have call successors, (86) [2023-12-22 02:29:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1123 transitions. [2023-12-22 02:29:08,395 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1123 transitions. Word has length 61 [2023-12-22 02:29:08,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:08,395 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 1123 transitions. [2023-12-22 02:29:08,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1123 transitions. [2023-12-22 02:29:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:29:08,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:08,396 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] [2023-12-22 02:29:08,400 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:08,600 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:08,600 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:08,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1993903418, now seen corresponding path program 1 times [2023-12-22 02:29:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:08,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073853435] [2023-12-22 02:29:08,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:08,601 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:08,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:08,602 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:08,632 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:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:08,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:08,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:08,669 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:08,669 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:08,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:08,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073853435] [2023-12-22 02:29:08,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073853435] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:08,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:08,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:08,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020949270] [2023-12-22 02:29:08,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:08,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:08,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:08,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:08,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:08,671 INFO L87 Difference]: Start difference. First operand 858 states and 1123 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:08,748 INFO L93 Difference]: Finished difference Result 1237 states and 1635 transitions. [2023-12-22 02:29:08,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:08,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 61 [2023-12-22 02:29:08,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:08,751 INFO L225 Difference]: With dead ends: 1237 [2023-12-22 02:29:08,751 INFO L226 Difference]: Without dead ends: 890 [2023-12-22 02:29:08,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 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:08,753 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 20 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:08,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 662 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2023-12-22 02:29:08,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 862. [2023-12-22 02:29:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 745 states have (on average 1.3006711409395972) internal successors, (969), 754 states have internal predecessors, (969), 66 states have call successors, (66), 45 states have call predecessors, (66), 49 states have return successors, (86), 63 states have call predecessors, (86), 65 states have call successors, (86) [2023-12-22 02:29:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1121 transitions. [2023-12-22 02:29:08,817 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1121 transitions. Word has length 61 [2023-12-22 02:29:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:08,818 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 1121 transitions. [2023-12-22 02:29:08,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1121 transitions. [2023-12-22 02:29:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:29:08,819 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:08,819 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] [2023-12-22 02:29:08,825 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:09,022 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:09,023 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:09,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:09,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1334371896, now seen corresponding path program 1 times [2023-12-22 02:29:09,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:09,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375628217] [2023-12-22 02:29:09,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:09,024 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:09,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:09,024 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:09,025 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:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:09,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:09,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:09,088 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:09,088 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:09,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:09,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375628217] [2023-12-22 02:29:09,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375628217] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:09,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:09,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:09,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903797932] [2023-12-22 02:29:09,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:09,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:09,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:09,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:09,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:09,089 INFO L87 Difference]: Start difference. First operand 862 states and 1121 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:09,162 INFO L93 Difference]: Finished difference Result 1233 states and 1615 transitions. [2023-12-22 02:29:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:09,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 61 [2023-12-22 02:29:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:09,165 INFO L225 Difference]: With dead ends: 1233 [2023-12-22 02:29:09,165 INFO L226 Difference]: Without dead ends: 882 [2023-12-22 02:29:09,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 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:09,167 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 11 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:09,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 666 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:09,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2023-12-22 02:29:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 866. [2023-12-22 02:29:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 749 states have (on average 1.2910547396528704) internal successors, (967), 758 states have internal predecessors, (967), 66 states have call successors, (66), 45 states have call predecessors, (66), 49 states have return successors, (86), 63 states have call predecessors, (86), 65 states have call successors, (86) [2023-12-22 02:29:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1119 transitions. [2023-12-22 02:29:09,209 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1119 transitions. Word has length 61 [2023-12-22 02:29:09,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:09,210 INFO L495 AbstractCegarLoop]: Abstraction has 866 states and 1119 transitions. [2023-12-22 02:29:09,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1119 transitions. [2023-12-22 02:29:09,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:29:09,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:09,211 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] [2023-12-22 02:29:09,217 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:09,414 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:09,415 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:09,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:09,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1059612282, now seen corresponding path program 1 times [2023-12-22 02:29:09,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:09,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882822287] [2023-12-22 02:29:09,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:09,416 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:09,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:09,417 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:09,421 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:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:09,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:09,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:09,474 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:09,475 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:09,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:09,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882822287] [2023-12-22 02:29:09,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882822287] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:09,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:09,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:09,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757534690] [2023-12-22 02:29:09,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:09,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:09,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:09,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:09,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:09,476 INFO L87 Difference]: Start difference. First operand 866 states and 1119 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:09,548 INFO L93 Difference]: Finished difference Result 1229 states and 1595 transitions. [2023-12-22 02:29:09,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:09,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 61 [2023-12-22 02:29:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:09,551 INFO L225 Difference]: With dead ends: 1229 [2023-12-22 02:29:09,552 INFO L226 Difference]: Without dead ends: 874 [2023-12-22 02:29:09,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 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:09,553 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 2 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:09,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 664 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2023-12-22 02:29:09,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 870. [2023-12-22 02:29:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 753 states have (on average 1.2815405046480743) internal successors, (965), 762 states have internal predecessors, (965), 66 states have call successors, (66), 45 states have call predecessors, (66), 49 states have return successors, (86), 63 states have call predecessors, (86), 65 states have call successors, (86) [2023-12-22 02:29:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1117 transitions. [2023-12-22 02:29:09,613 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1117 transitions. Word has length 61 [2023-12-22 02:29:09,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:09,613 INFO L495 AbstractCegarLoop]: Abstraction has 870 states and 1117 transitions. [2023-12-22 02:29:09,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1117 transitions. [2023-12-22 02:29:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:29:09,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:09,614 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] [2023-12-22 02:29:09,618 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:09,818 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:09,818 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:09,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:09,818 INFO L85 PathProgramCache]: Analyzing trace with hash 863615752, now seen corresponding path program 1 times [2023-12-22 02:29:09,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:09,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559535895] [2023-12-22 02:29:09,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:09,819 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:09,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:09,820 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:09,823 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:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:09,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-22 02:29:09,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:09,922 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:09,922 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:09,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:09,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559535895] [2023-12-22 02:29:09,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559535895] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:09,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:09,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:09,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740761190] [2023-12-22 02:29:09,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:09,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:09,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:09,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:09,924 INFO L87 Difference]: Start difference. First operand 870 states and 1117 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:10,121 INFO L93 Difference]: Finished difference Result 1230 states and 1574 transitions. [2023-12-22 02:29:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:10,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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 61 [2023-12-22 02:29:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:10,125 INFO L225 Difference]: With dead ends: 1230 [2023-12-22 02:29:10,125 INFO L226 Difference]: Without dead ends: 870 [2023-12-22 02:29:10,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 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:10,126 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 266 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:10,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 366 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2023-12-22 02:29:10,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2023-12-22 02:29:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 753 states have (on average 1.2722443559096945) internal successors, (958), 762 states have internal predecessors, (958), 66 states have call successors, (66), 45 states have call predecessors, (66), 49 states have return successors, (86), 63 states have call predecessors, (86), 65 states have call successors, (86) [2023-12-22 02:29:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1110 transitions. [2023-12-22 02:29:10,174 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1110 transitions. Word has length 61 [2023-12-22 02:29:10,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:10,174 INFO L495 AbstractCegarLoop]: Abstraction has 870 states and 1110 transitions. [2023-12-22 02:29:10,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1110 transitions. [2023-12-22 02:29:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:29:10,175 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:10,175 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] [2023-12-22 02:29:10,178 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:10,378 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:10,379 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:10,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:10,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1286317578, now seen corresponding path program 1 times [2023-12-22 02:29:10,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:10,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350681736] [2023-12-22 02:29:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:10,380 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:10,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:10,381 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:10,404 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:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:10,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:10,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:10,514 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:10,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:10,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:10,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350681736] [2023-12-22 02:29:10,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350681736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:10,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:10,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:29:10,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221622297] [2023-12-22 02:29:10,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:10,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:10,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:10,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:10,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:10,517 INFO L87 Difference]: Start difference. First operand 870 states and 1110 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:10,647 INFO L93 Difference]: Finished difference Result 1567 states and 1979 transitions. [2023-12-22 02:29:10,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:10,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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 61 [2023-12-22 02:29:10,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:10,652 INFO L225 Difference]: With dead ends: 1567 [2023-12-22 02:29:10,652 INFO L226 Difference]: Without dead ends: 1208 [2023-12-22 02:29:10,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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:10,653 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 173 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:10,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 374 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2023-12-22 02:29:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1206. [2023-12-22 02:29:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1039 states have (on average 1.2540904716073147) internal successors, (1303), 1051 states have internal predecessors, (1303), 93 states have call successors, (93), 67 states have call predecessors, (93), 72 states have return successors, (114), 88 states have call predecessors, (114), 92 states have call successors, (114) [2023-12-22 02:29:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1510 transitions. [2023-12-22 02:29:10,718 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1510 transitions. Word has length 61 [2023-12-22 02:29:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:10,718 INFO L495 AbstractCegarLoop]: Abstraction has 1206 states and 1510 transitions. [2023-12-22 02:29:10,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1510 transitions. [2023-12-22 02:29:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:29:10,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:10,720 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:10,726 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 (19)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:10,923 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:10,924 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:10,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:10,924 INFO L85 PathProgramCache]: Analyzing trace with hash 89678806, now seen corresponding path program 1 times [2023-12-22 02:29:10,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:10,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160661764] [2023-12-22 02:29:10,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:10,925 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:10,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:10,926 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:10,959 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:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:10,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:29:10,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:11,138 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:11,138 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:29:11,202 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:11,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:11,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160661764] [2023-12-22 02:29:11,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160661764] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 02:29:11,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 02:29:11,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2023-12-22 02:29:11,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262261955] [2023-12-22 02:29:11,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 02:29:11,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-22 02:29:11,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:11,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-22 02:29:11,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:29:11,204 INFO L87 Difference]: Start difference. First operand 1206 states and 1510 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:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:11,505 INFO L93 Difference]: Finished difference Result 1925 states and 2448 transitions. [2023-12-22 02:29:11,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 02:29:11,505 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:11,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:11,511 INFO L225 Difference]: With dead ends: 1925 [2023-12-22 02:29:11,512 INFO L226 Difference]: Without dead ends: 1922 [2023-12-22 02:29:11,512 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:11,513 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 397 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:11,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1139 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2023-12-22 02:29:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1509. [2023-12-22 02:29:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1306 states have (on average 1.262633996937213) internal successors, (1649), 1324 states have internal predecessors, (1649), 112 states have call successors, (112), 80 states have call predecessors, (112), 89 states have return successors, (145), 105 states have call predecessors, (145), 111 states have call successors, (145) [2023-12-22 02:29:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1906 transitions. [2023-12-22 02:29:11,639 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1906 transitions. Word has length 61 [2023-12-22 02:29:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:11,639 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 1906 transitions. [2023-12-22 02:29:11,639 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:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1906 transitions. [2023-12-22 02:29:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-22 02:29:11,641 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:11,641 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:11,656 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:11,852 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:11,852 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:11,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1275804189, now seen corresponding path program 2 times [2023-12-22 02:29:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:11,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372269431] [2023-12-22 02:29:11,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 02:29:11,853 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:11,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:11,854 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:11,876 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:11,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-22 02:29:11,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 02:29:11,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:11,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:11,941 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:11,941 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:11,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:11,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372269431] [2023-12-22 02:29:11,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372269431] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:11,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:11,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:11,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493438579] [2023-12-22 02:29:11,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:11,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:11,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:11,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:11,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:11,943 INFO L87 Difference]: Start difference. First operand 1509 states and 1906 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:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:12,040 INFO L93 Difference]: Finished difference Result 2064 states and 2637 transitions. [2023-12-22 02:29:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:12,040 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:12,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:12,044 INFO L225 Difference]: With dead ends: 2064 [2023-12-22 02:29:12,045 INFO L226 Difference]: Without dead ends: 1413 [2023-12-22 02:29:12,046 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:12,047 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 208 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:12,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 312 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2023-12-22 02:29:12,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1401. [2023-12-22 02:29:12,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1211 states have (on average 1.2559867877786952) internal successors, (1521), 1229 states have internal predecessors, (1521), 105 states have call successors, (105), 75 states have call predecessors, (105), 83 states have return successors, (134), 97 states have call predecessors, (134), 104 states have call successors, (134) [2023-12-22 02:29:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1760 transitions. [2023-12-22 02:29:12,125 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1760 transitions. Word has length 78 [2023-12-22 02:29:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:12,125 INFO L495 AbstractCegarLoop]: Abstraction has 1401 states and 1760 transitions. [2023-12-22 02:29:12,125 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:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1760 transitions. [2023-12-22 02:29:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-22 02:29:12,127 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:12,128 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:12,134 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:12,331 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:12,332 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:12,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:12,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1576457092, now seen corresponding path program 1 times [2023-12-22 02:29:12,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:12,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853713583] [2023-12-22 02:29:12,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:12,333 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:12,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:12,334 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:12,334 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:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:12,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:12,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:12,451 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:12,452 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:12,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:12,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853713583] [2023-12-22 02:29:12,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853713583] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:12,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:12,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:12,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969121534] [2023-12-22 02:29:12,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:12,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:12,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:12,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:12,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:12,453 INFO L87 Difference]: Start difference. First operand 1401 states and 1760 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:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:12,662 INFO L93 Difference]: Finished difference Result 2125 states and 2701 transitions. [2023-12-22 02:29:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:12,663 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:12,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:12,670 INFO L225 Difference]: With dead ends: 2125 [2023-12-22 02:29:12,670 INFO L226 Difference]: Without dead ends: 1434 [2023-12-22 02:29:12,672 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:12,672 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 263 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:12,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 323 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2023-12-22 02:29:12,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1401. [2023-12-22 02:29:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1211 states have (on average 1.2436003303055325) internal successors, (1506), 1229 states have internal predecessors, (1506), 105 states have call successors, (105), 75 states have call predecessors, (105), 83 states have return successors, (133), 97 states have call predecessors, (133), 104 states have call successors, (133) [2023-12-22 02:29:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1744 transitions. [2023-12-22 02:29:12,756 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1744 transitions. Word has length 92 [2023-12-22 02:29:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:12,756 INFO L495 AbstractCegarLoop]: Abstraction has 1401 states and 1744 transitions. [2023-12-22 02:29:12,756 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:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1744 transitions. [2023-12-22 02:29:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-22 02:29:12,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:12,758 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:12,762 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:12,961 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:12,962 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:12,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:12,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1503163014, now seen corresponding path program 1 times [2023-12-22 02:29:12,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:12,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938042904] [2023-12-22 02:29:12,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:12,963 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:12,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:12,964 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:12,991 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:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:13,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:13,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:13,051 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:13,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:13,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:13,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938042904] [2023-12-22 02:29:13,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938042904] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:13,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:13,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:13,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47136747] [2023-12-22 02:29:13,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:13,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:13,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:13,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:13,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:13,053 INFO L87 Difference]: Start difference. First operand 1401 states and 1744 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:13,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:13,167 INFO L93 Difference]: Finished difference Result 1684 states and 2095 transitions. [2023-12-22 02:29:13,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:13,167 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:13,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:13,169 INFO L225 Difference]: With dead ends: 1684 [2023-12-22 02:29:13,169 INFO L226 Difference]: Without dead ends: 705 [2023-12-22 02:29:13,172 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:13,172 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 54 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:13,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 458 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2023-12-22 02:29:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2023-12-22 02:29:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 600 states have (on average 1.2316666666666667) internal successors, (739), 605 states have internal predecessors, (739), 58 states have call successors, (58), 44 states have call predecessors, (58), 46 states have return successors, (60), 56 states have call predecessors, (60), 58 states have call successors, (60) [2023-12-22 02:29:13,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 857 transitions. [2023-12-22 02:29:13,208 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 857 transitions. Word has length 93 [2023-12-22 02:29:13,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:13,208 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 857 transitions. [2023-12-22 02:29:13,208 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:13,208 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 857 transitions. [2023-12-22 02:29:13,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-22 02:29:13,209 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:13,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,218 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:13,412 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:13,412 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:13,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash 951931183, now seen corresponding path program 1 times [2023-12-22 02:29:13,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:13,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34668059] [2023-12-22 02:29:13,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:13,413 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:13,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:13,414 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:13,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 (24)] Waiting until timeout for monitored process [2023-12-22 02:29:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:13,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:13,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-22 02:29:13,544 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:13,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:13,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34668059] [2023-12-22 02:29:13,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34668059] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:13,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:13,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:29:13,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318110656] [2023-12-22 02:29:13,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:13,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:13,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:13,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:13,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:13,545 INFO L87 Difference]: Start difference. First operand 705 states and 857 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:13,638 INFO L93 Difference]: Finished difference Result 1960 states and 2396 transitions. [2023-12-22 02:29:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:13,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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 99 [2023-12-22 02:29:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:13,643 INFO L225 Difference]: With dead ends: 1960 [2023-12-22 02:29:13,643 INFO L226 Difference]: Without dead ends: 1265 [2023-12-22 02:29:13,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 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:13,645 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 85 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:13,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 301 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2023-12-22 02:29:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1259. [2023-12-22 02:29:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1070 states have (on average 1.214018691588785) internal successors, (1299), 1079 states have internal predecessors, (1299), 104 states have call successors, (104), 80 states have call predecessors, (104), 84 states have return successors, (108), 100 states have call predecessors, (108), 104 states have call successors, (108) [2023-12-22 02:29:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1511 transitions. [2023-12-22 02:29:13,730 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1511 transitions. Word has length 99 [2023-12-22 02:29:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:13,731 INFO L495 AbstractCegarLoop]: Abstraction has 1259 states and 1511 transitions. [2023-12-22 02:29:13,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1511 transitions. [2023-12-22 02:29:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-22 02:29:13,732 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:13,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,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 (24)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:13,935 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:13,935 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:13,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1037858096, now seen corresponding path program 1 times [2023-12-22 02:29:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:13,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335514630] [2023-12-22 02:29:13,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:13,937 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:13,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:13,938 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:13,965 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:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:13,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-22 02:29:14,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-22 02:29:14,091 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:14,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:14,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335514630] [2023-12-22 02:29:14,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335514630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:14,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:14,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:14,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136745836] [2023-12-22 02:29:14,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:14,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:14,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:14,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:14,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:14,093 INFO L87 Difference]: Start difference. First operand 1259 states and 1511 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:14,361 INFO L93 Difference]: Finished difference Result 3654 states and 4410 transitions. [2023-12-22 02:29:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:14,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 99 [2023-12-22 02:29:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:14,369 INFO L225 Difference]: With dead ends: 3654 [2023-12-22 02:29:14,369 INFO L226 Difference]: Without dead ends: 2406 [2023-12-22 02:29:14,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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:14,372 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 162 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:14,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 358 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2023-12-22 02:29:14,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2404. [2023-12-22 02:29:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 2036 states have (on average 1.1974459724950883) internal successors, (2438), 2058 states have internal predecessors, (2438), 199 states have call successors, (199), 152 states have call predecessors, (199), 168 states have return successors, (239), 195 states have call predecessors, (239), 199 states have call successors, (239) [2023-12-22 02:29:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 2876 transitions. [2023-12-22 02:29:14,530 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 2876 transitions. Word has length 99 [2023-12-22 02:29:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:14,530 INFO L495 AbstractCegarLoop]: Abstraction has 2404 states and 2876 transitions. [2023-12-22 02:29:14,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 2876 transitions. [2023-12-22 02:29:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-22 02:29:14,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:14,533 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,536 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:14,737 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:14,737 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:14,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:14,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1066358386, now seen corresponding path program 1 times [2023-12-22 02:29:14,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:14,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437990561] [2023-12-22 02:29:14,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:14,738 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:14,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:14,739 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:14,740 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:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:14,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:14,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-22 02:29:14,821 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:14,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:14,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437990561] [2023-12-22 02:29:14,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437990561] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:14,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:14,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:14,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893043675] [2023-12-22 02:29:14,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:14,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:14,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:14,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:14,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:14,823 INFO L87 Difference]: Start difference. First operand 2404 states and 2876 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:14,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:14,954 INFO L93 Difference]: Finished difference Result 4250 states and 5075 transitions. [2023-12-22 02:29:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:14,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 99 [2023-12-22 02:29:14,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:14,959 INFO L225 Difference]: With dead ends: 4250 [2023-12-22 02:29:14,960 INFO L226 Difference]: Without dead ends: 1857 [2023-12-22 02:29:14,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 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:14,964 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 152 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:14,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 144 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2023-12-22 02:29:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1857. [2023-12-22 02:29:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1576 states have (on average 1.1992385786802031) internal successors, (1890), 1593 states have internal predecessors, (1890), 150 states have call successors, (150), 116 states have call predecessors, (150), 130 states have return successors, (176), 148 states have call predecessors, (176), 150 states have call successors, (176) [2023-12-22 02:29:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2216 transitions. [2023-12-22 02:29:15,079 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2216 transitions. Word has length 99 [2023-12-22 02:29:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:15,079 INFO L495 AbstractCegarLoop]: Abstraction has 1857 states and 2216 transitions. [2023-12-22 02:29:15,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2216 transitions. [2023-12-22 02:29:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-22 02:29:15,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:15,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,086 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 (26)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:15,284 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:15,285 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:15,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:15,285 INFO L85 PathProgramCache]: Analyzing trace with hash 412257269, now seen corresponding path program 1 times [2023-12-22 02:29:15,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:15,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233582310] [2023-12-22 02:29:15,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:15,285 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:15,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:15,287 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:15,315 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:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:15,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-22 02:29:15,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-22 02:29:15,436 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:15,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:15,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233582310] [2023-12-22 02:29:15,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233582310] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:15,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:15,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:15,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218216509] [2023-12-22 02:29:15,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:15,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:15,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:15,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:15,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:15,439 INFO L87 Difference]: Start difference. First operand 1857 states and 2216 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:15,822 INFO L93 Difference]: Finished difference Result 5207 states and 6225 transitions. [2023-12-22 02:29:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:15,823 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), 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 101 [2023-12-22 02:29:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:15,841 INFO L225 Difference]: With dead ends: 5207 [2023-12-22 02:29:15,842 INFO L226 Difference]: Without dead ends: 3361 [2023-12-22 02:29:15,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 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:15,847 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 153 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:15,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 334 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:15,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2023-12-22 02:29:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 3359. [2023-12-22 02:29:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3359 states, 2839 states have (on average 1.1887988728425503) internal successors, (3375), 2877 states have internal predecessors, (3375), 275 states have call successors, (275), 208 states have call predecessors, (275), 244 states have return successors, (347), 275 states have call predecessors, (347), 275 states have call successors, (347) [2023-12-22 02:29:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 3997 transitions. [2023-12-22 02:29:16,054 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 3997 transitions. Word has length 101 [2023-12-22 02:29:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:16,054 INFO L495 AbstractCegarLoop]: Abstraction has 3359 states and 3997 transitions. [2023-12-22 02:29:16,054 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), 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:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 3997 transitions. [2023-12-22 02:29:16,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-22 02:29:16,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:16,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,068 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:16,260 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:16,261 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:16,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash -471251721, now seen corresponding path program 1 times [2023-12-22 02:29:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:16,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900764087] [2023-12-22 02:29:16,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:16,261 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:16,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:16,262 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:16,289 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:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:16,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:16,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-22 02:29:16,334 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:16,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:16,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900764087] [2023-12-22 02:29:16,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900764087] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:16,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:16,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:16,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472779860] [2023-12-22 02:29:16,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:16,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:16,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:16,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:16,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:16,335 INFO L87 Difference]: Start difference. First operand 3359 states and 3997 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:16,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:16,525 INFO L93 Difference]: Finished difference Result 6703 states and 7970 transitions. [2023-12-22 02:29:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:16,525 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), 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 101 [2023-12-22 02:29:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:16,533 INFO L225 Difference]: With dead ends: 6703 [2023-12-22 02:29:16,533 INFO L226 Difference]: Without dead ends: 3355 [2023-12-22 02:29:16,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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:16,538 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 150 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:16,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 143 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2023-12-22 02:29:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 3355. [2023-12-22 02:29:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 2838 states have (on average 1.1885130373502466) internal successors, (3373), 2875 states have internal predecessors, (3373), 272 states have call successors, (272), 208 states have call predecessors, (272), 244 states have return successors, (344), 272 states have call predecessors, (344), 272 states have call successors, (344) [2023-12-22 02:29:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 3989 transitions. [2023-12-22 02:29:16,740 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 3989 transitions. Word has length 101 [2023-12-22 02:29:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:16,741 INFO L495 AbstractCegarLoop]: Abstraction has 3355 states and 3989 transitions. [2023-12-22 02:29:16,741 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), 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:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 3989 transitions. [2023-12-22 02:29:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-22 02:29:16,742 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:16,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,748 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:16,946 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:16,946 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:16,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:16,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1936977616, now seen corresponding path program 1 times [2023-12-22 02:29:16,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:16,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227537665] [2023-12-22 02:29:16,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:16,947 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:16,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:16,948 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:16,953 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:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:17,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:17,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-22 02:29:17,031 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:17,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:17,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227537665] [2023-12-22 02:29:17,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227537665] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:17,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:17,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:17,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733037142] [2023-12-22 02:29:17,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:17,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:17,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:17,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:17,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:17,033 INFO L87 Difference]: Start difference. First operand 3355 states and 3989 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:17,435 INFO L93 Difference]: Finished difference Result 9247 states and 11075 transitions. [2023-12-22 02:29:17,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:17,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 103 [2023-12-22 02:29:17,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:17,446 INFO L225 Difference]: With dead ends: 9247 [2023-12-22 02:29:17,446 INFO L226 Difference]: Without dead ends: 4649 [2023-12-22 02:29:17,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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:17,453 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 122 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:17,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 393 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2023-12-22 02:29:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4649. [2023-12-22 02:29:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4649 states, 3932 states have (on average 1.1826042726347914) internal successors, (4650), 3977 states have internal predecessors, (4650), 382 states have call successors, (382), 288 states have call predecessors, (382), 334 states have return successors, (494), 384 states have call predecessors, (494), 382 states have call successors, (494) [2023-12-22 02:29:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4649 states to 4649 states and 5526 transitions. [2023-12-22 02:29:17,737 INFO L78 Accepts]: Start accepts. Automaton has 4649 states and 5526 transitions. Word has length 103 [2023-12-22 02:29:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:17,737 INFO L495 AbstractCegarLoop]: Abstraction has 4649 states and 5526 transitions. [2023-12-22 02:29:17,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 4649 states and 5526 transitions. [2023-12-22 02:29:17,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-22 02:29:17,740 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:17,740 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:17,744 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:17,943 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:17,944 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:17,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:17,944 INFO L85 PathProgramCache]: Analyzing trace with hash -171431204, now seen corresponding path program 1 times [2023-12-22 02:29:17,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:17,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296865527] [2023-12-22 02:29:17,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:17,945 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:17,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:17,945 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:17,946 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:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:18,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:18,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-22 02:29:18,106 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:18,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:18,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296865527] [2023-12-22 02:29:18,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296865527] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:18,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:18,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:29:18,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902637378] [2023-12-22 02:29:18,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:18,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:18,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:18,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:18,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:18,107 INFO L87 Difference]: Start difference. First operand 4649 states and 5526 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:18,473 INFO L93 Difference]: Finished difference Result 10580 states and 12592 transitions. [2023-12-22 02:29:18,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:18,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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 129 [2023-12-22 02:29:18,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:18,489 INFO L225 Difference]: With dead ends: 10580 [2023-12-22 02:29:18,489 INFO L226 Difference]: Without dead ends: 5941 [2023-12-22 02:29:18,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 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:18,495 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 63 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:18,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 268 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5941 states. [2023-12-22 02:29:18,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5941 to 5923. [2023-12-22 02:29:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5923 states, 5006 states have (on average 1.1713943268078306) internal successors, (5864), 5059 states have internal predecessors, (5864), 492 states have call successors, (492), 368 states have call predecessors, (492), 424 states have return successors, (626), 496 states have call predecessors, (626), 492 states have call successors, (626) [2023-12-22 02:29:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5923 states to 5923 states and 6982 transitions. [2023-12-22 02:29:18,887 INFO L78 Accepts]: Start accepts. Automaton has 5923 states and 6982 transitions. Word has length 129 [2023-12-22 02:29:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:18,887 INFO L495 AbstractCegarLoop]: Abstraction has 5923 states and 6982 transitions. [2023-12-22 02:29:18,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 5923 states and 6982 transitions. [2023-12-22 02:29:18,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-22 02:29:18,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:18,892 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, 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] [2023-12-22 02:29:18,898 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:19,095 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:19,096 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:19,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:19,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1546303319, now seen corresponding path program 1 times [2023-12-22 02:29:19,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:19,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015712694] [2023-12-22 02:29:19,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:19,097 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:19,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:19,098 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:19,098 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:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:19,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:19,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-22 02:29:19,228 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:19,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015712694] [2023-12-22 02:29:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015712694] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146091818] [2023-12-22 02:29:19,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:19,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:19,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:19,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:19,229 INFO L87 Difference]: Start difference. First operand 5923 states and 6982 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:19,734 INFO L93 Difference]: Finished difference Result 11889 states and 14077 transitions. [2023-12-22 02:29:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:19,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 147 [2023-12-22 02:29:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:19,746 INFO L225 Difference]: With dead ends: 11889 [2023-12-22 02:29:19,747 INFO L226 Difference]: Without dead ends: 5977 [2023-12-22 02:29:19,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 145 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:19,754 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 166 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:19,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 270 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:19,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5977 states. [2023-12-22 02:29:20,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5977 to 5977. [2023-12-22 02:29:20,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5977 states, 5048 states have (on average 1.1572900158478605) internal successors, (5842), 5107 states have internal predecessors, (5842), 492 states have call successors, (492), 368 states have call predecessors, (492), 436 states have return successors, (584), 502 states have call predecessors, (584), 492 states have call successors, (584) [2023-12-22 02:29:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5977 states to 5977 states and 6918 transitions. [2023-12-22 02:29:20,139 INFO L78 Accepts]: Start accepts. Automaton has 5977 states and 6918 transitions. Word has length 147 [2023-12-22 02:29:20,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:20,139 INFO L495 AbstractCegarLoop]: Abstraction has 5977 states and 6918 transitions. [2023-12-22 02:29:20,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:20,139 INFO L276 IsEmpty]: Start isEmpty. Operand 5977 states and 6918 transitions. [2023-12-22 02:29:20,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-22 02:29:20,143 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:20,143 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, 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] [2023-12-22 02:29:20,146 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:20,346 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:20,347 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:20,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:20,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1461356757, now seen corresponding path program 1 times [2023-12-22 02:29:20,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:20,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878700108] [2023-12-22 02:29:20,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:20,347 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:20,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:20,348 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:20,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 (32)] Waiting until timeout for monitored process [2023-12-22 02:29:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:20,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:20,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-22 02:29:20,439 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:20,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:20,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878700108] [2023-12-22 02:29:20,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878700108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:20,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:20,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:20,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394946852] [2023-12-22 02:29:20,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:20,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:20,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:20,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:20,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:20,440 INFO L87 Difference]: Start difference. First operand 5977 states and 6918 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:29:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:20,750 INFO L93 Difference]: Finished difference Result 9671 states and 11240 transitions. [2023-12-22 02:29:20,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:20,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 148 [2023-12-22 02:29:20,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:20,759 INFO L225 Difference]: With dead ends: 9671 [2023-12-22 02:29:20,759 INFO L226 Difference]: Without dead ends: 4971 [2023-12-22 02:29:20,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 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:20,766 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 112 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 384 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:29:20,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 384 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:20,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4971 states. [2023-12-22 02:29:21,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4971 to 4969. [2023-12-22 02:29:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4969 states, 4196 states have (on average 1.1549094375595805) internal successors, (4846), 4245 states have internal predecessors, (4846), 408 states have call successors, (408), 304 states have call predecessors, (408), 364 states have return successors, (486), 420 states have call predecessors, (486), 408 states have call successors, (486) [2023-12-22 02:29:21,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4969 states to 4969 states and 5740 transitions. [2023-12-22 02:29:21,144 INFO L78 Accepts]: Start accepts. Automaton has 4969 states and 5740 transitions. Word has length 148 [2023-12-22 02:29:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:21,144 INFO L495 AbstractCegarLoop]: Abstraction has 4969 states and 5740 transitions. [2023-12-22 02:29:21,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:29:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 4969 states and 5740 transitions. [2023-12-22 02:29:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-22 02:29:21,150 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:21,150 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:21,154 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:21,354 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:21,354 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:21,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:21,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1081582626, now seen corresponding path program 1 times [2023-12-22 02:29:21,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:21,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628930935] [2023-12-22 02:29:21,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:21,355 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:21,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:21,356 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:21,357 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:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:21,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:21,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-22 02:29:21,470 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:21,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:21,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628930935] [2023-12-22 02:29:21,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628930935] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:21,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:21,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:21,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804545207] [2023-12-22 02:29:21,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:21,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:21,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:21,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:21,472 INFO L87 Difference]: Start difference. First operand 4969 states and 5740 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:29:21,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:21,702 INFO L93 Difference]: Finished difference Result 6749 states and 7797 transitions. [2023-12-22 02:29:21,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:21,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 177 [2023-12-22 02:29:21,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:21,707 INFO L225 Difference]: With dead ends: 6749 [2023-12-22 02:29:21,707 INFO L226 Difference]: Without dead ends: 1587 [2023-12-22 02:29:21,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 175 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:21,714 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 115 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:21,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 328 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:21,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2023-12-22 02:29:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1587. [2023-12-22 02:29:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1334 states have (on average 1.106446776611694) internal successors, (1476), 1345 states have internal predecessors, (1476), 144 states have call successors, (144), 100 states have call predecessors, (144), 108 states have return successors, (152), 142 states have call predecessors, (152), 144 states have call successors, (152) [2023-12-22 02:29:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 1772 transitions. [2023-12-22 02:29:21,820 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 1772 transitions. Word has length 177 [2023-12-22 02:29:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:21,820 INFO L495 AbstractCegarLoop]: Abstraction has 1587 states and 1772 transitions. [2023-12-22 02:29:21,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:29:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1772 transitions. [2023-12-22 02:29:21,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-22 02:29:21,823 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:21,823 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,828 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:22,027 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:22,027 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:22,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:22,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1135643356, now seen corresponding path program 1 times [2023-12-22 02:29:22,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:22,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783103356] [2023-12-22 02:29:22,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:22,028 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:22,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:22,029 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:22,056 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:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:22,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:22,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-22 02:29:22,135 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:22,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:22,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783103356] [2023-12-22 02:29:22,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783103356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:22,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:22,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:22,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898929400] [2023-12-22 02:29:22,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:22,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:22,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:22,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:22,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:22,137 INFO L87 Difference]: Start difference. First operand 1587 states and 1772 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-22 02:29:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:22,279 INFO L93 Difference]: Finished difference Result 2605 states and 2940 transitions. [2023-12-22 02:29:22,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:22,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 178 [2023-12-22 02:29:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:22,282 INFO L225 Difference]: With dead ends: 2605 [2023-12-22 02:29:22,282 INFO L226 Difference]: Without dead ends: 1587 [2023-12-22 02:29:22,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 176 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:22,285 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 122 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:22,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 351 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2023-12-22 02:29:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1587. [2023-12-22 02:29:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1334 states have (on average 1.0944527736131935) internal successors, (1460), 1345 states have internal predecessors, (1460), 144 states have call successors, (144), 100 states have call predecessors, (144), 108 states have return successors, (152), 142 states have call predecessors, (152), 144 states have call successors, (152) [2023-12-22 02:29:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 1756 transitions. [2023-12-22 02:29:22,392 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 1756 transitions. Word has length 178 [2023-12-22 02:29:22,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:22,392 INFO L495 AbstractCegarLoop]: Abstraction has 1587 states and 1756 transitions. [2023-12-22 02:29:22,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-22 02:29:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1756 transitions. [2023-12-22 02:29:22,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-12-22 02:29:22,395 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:22,395 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,401 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:22,598 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:22,599 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:22,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:22,599 INFO L85 PathProgramCache]: Analyzing trace with hash 646684408, now seen corresponding path program 1 times [2023-12-22 02:29:22,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:22,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488056304] [2023-12-22 02:29:22,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:22,600 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:22,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:22,600 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:22,601 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:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:22,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:22,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-22 02:29:22,726 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:22,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:22,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488056304] [2023-12-22 02:29:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488056304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:22,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:22,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:22,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258380196] [2023-12-22 02:29:22,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:22,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:22,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:22,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:22,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:22,727 INFO L87 Difference]: Start difference. First operand 1587 states and 1756 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, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-22 02:29:22,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:22,912 INFO L93 Difference]: Finished difference Result 3207 states and 3603 transitions. [2023-12-22 02:29:22,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:22,912 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, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 180 [2023-12-22 02:29:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:22,916 INFO L225 Difference]: With dead ends: 3207 [2023-12-22 02:29:22,916 INFO L226 Difference]: Without dead ends: 1793 [2023-12-22 02:29:22,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 178 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:22,918 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 114 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:22,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 264 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2023-12-22 02:29:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1791. [2023-12-22 02:29:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1504 states have (on average 1.0884308510638299) internal successors, (1637), 1518 states have internal predecessors, (1637), 163 states have call successors, (163), 114 states have call predecessors, (163), 123 states have return successors, (179), 159 states have call predecessors, (179), 163 states have call successors, (179) [2023-12-22 02:29:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 1979 transitions. [2023-12-22 02:29:23,051 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 1979 transitions. Word has length 180 [2023-12-22 02:29:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:23,052 INFO L495 AbstractCegarLoop]: Abstraction has 1791 states and 1979 transitions. [2023-12-22 02:29:23,052 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, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-22 02:29:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 1979 transitions. [2023-12-22 02:29:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-22 02:29:23,054 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:23,054 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,058 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 (35)] Ended with exit code 0 [2023-12-22 02:29:23,257 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:23,258 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:23,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:23,258 INFO L85 PathProgramCache]: Analyzing trace with hash -79866157, now seen corresponding path program 1 times [2023-12-22 02:29:23,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:23,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642880586] [2023-12-22 02:29:23,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:23,259 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:23,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:23,260 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:23,261 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:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:23,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:23,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-22 02:29:23,359 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:23,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:23,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642880586] [2023-12-22 02:29:23,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642880586] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:23,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:23,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:23,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926681226] [2023-12-22 02:29:23,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:23,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:23,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:23,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:23,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:23,360 INFO L87 Difference]: Start difference. First operand 1791 states and 1979 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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:29:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:23,502 INFO L93 Difference]: Finished difference Result 3233 states and 3603 transitions. [2023-12-22 02:29:23,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:23,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 181 [2023-12-22 02:29:23,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:23,505 INFO L225 Difference]: With dead ends: 3233 [2023-12-22 02:29:23,505 INFO L226 Difference]: Without dead ends: 1791 [2023-12-22 02:29:23,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 179 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:23,508 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 126 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:23,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 287 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:23,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2023-12-22 02:29:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1791. [2023-12-22 02:29:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1504 states have (on average 1.0764627659574468) internal successors, (1619), 1518 states have internal predecessors, (1619), 163 states have call successors, (163), 114 states have call predecessors, (163), 123 states have return successors, (179), 159 states have call predecessors, (179), 163 states have call successors, (179) [2023-12-22 02:29:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 1961 transitions. [2023-12-22 02:29:23,633 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 1961 transitions. Word has length 181 [2023-12-22 02:29:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:23,633 INFO L495 AbstractCegarLoop]: Abstraction has 1791 states and 1961 transitions. [2023-12-22 02:29:23,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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:29:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 1961 transitions. [2023-12-22 02:29:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-22 02:29:23,635 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:23,636 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,642 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 (36)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:23,839 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:29:23,840 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:23,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:23,840 INFO L85 PathProgramCache]: Analyzing trace with hash 677916105, now seen corresponding path program 1 times [2023-12-22 02:29:23,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:23,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960006762] [2023-12-22 02:29:23,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:23,841 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:23,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:23,842 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:29:23,848 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:29:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:23,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:23,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 82 proven. 61 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-22 02:29:24,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:29:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-22 02:29:24,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:24,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960006762] [2023-12-22 02:29:24,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960006762] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 02:29:24,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 02:29:24,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2023-12-22 02:29:24,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378272219] [2023-12-22 02:29:24,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:24,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:24,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:24,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:24,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:24,184 INFO L87 Difference]: Start difference. First operand 1791 states and 1961 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-22 02:29:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:24,540 INFO L93 Difference]: Finished difference Result 1793 states and 1963 transitions. [2023-12-22 02:29:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:24,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 183 [2023-12-22 02:29:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:24,541 INFO L225 Difference]: With dead ends: 1793 [2023-12-22 02:29:24,541 INFO L226 Difference]: Without dead ends: 0 [2023-12-22 02:29:24,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:24,543 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 306 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:24,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 785 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-22 02:29:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-22 02:29:24,544 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:29:24,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-22 02:29:24,544 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2023-12-22 02:29:24,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:24,544 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-22 02:29:24,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-22 02:29:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-22 02:29:24,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-22 02:29:24,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-22 02:29:24,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-22 02:29:24,553 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:29:24,750 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:29:24,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-22 02:30:00,570 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 820 830) no Hoare annotation was computed. [2023-12-22 02:30:00,570 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 820 830) no Hoare annotation was computed. [2023-12-22 02:30:00,571 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 820 830) the Hoare annotation is: (let ((.cse19 (= ~t2_st~0 (_ bv2 32))) (.cse30 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse32 (= (_ bv2 32) ~m_st~0)) (.cse34 (= ~t1_st~0 (_ bv2 32))) (.cse38 (= |old(~t2_st~0)| ~t2_st~0))) (let ((.cse36 (not (= ~local~0 ~token~0))) (.cse25 (and .cse32 .cse34 .cse38)) (.cse27 (not (= (_ bv2 32) |old(~t1_st~0)|))) (.cse35 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse29 (not (= |old(~t2_st~0)| (_ bv0 32)))) (.cse21 (not (= (_ bv0 32) |old(~t1_st~0)|))) (.cse33 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse24 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse18 (= |old(~m_st~0)| ~m_st~0)) (.cse20 (= ~t1_st~0 (_ bv0 32))) (.cse31 (= ~t2_st~0 (_ bv0 32))) (.cse16 (not (= (_ bv2 32) ~E_2~0))) (.cse6 (and .cse30 .cse32 .cse38)) (.cse8 (not (= (_ bv0 32) ~m_pc~0))) (.cse0 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse2 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse3 (not (= (_ bv2 32) ~T1_E~0))) (.cse4 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse5 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse7 (not (= (_ bv1 32) ~t1_i~0))) (.cse9 (not (= ~q_free~0 (_ bv0 32)))) (.cse26 (not (= ~t2_pc~0 (_ bv1 32)))) (.cse10 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse11 (not (= (_ bv2 32) ~T2_E~0))) (.cse22 (not (= |old(~t2_st~0)| (_ bv2 32)))) (.cse28 (= (_ bv1 32) ~m_pc~0)) (.cse12 (not (= (_ bv2 32) ~E_1~0))) (.cse23 (not (= (_ bv2 32) ~E_M~0))) (.cse13 (not (= (_ bv1 32) ~t2_i~0))) (.cse14 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse37 (and .cse19 .cse30 .cse32)) (.cse15 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse1 (and .cse18 .cse19 .cse20) .cse2 .cse3 .cse21 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse23 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse25 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse26 .cse27 .cse10 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse29 .cse2 .cse3 .cse4 .cse5 .cse7 (and .cse30 .cse31 .cse32) .cse33 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse15 .cse17) (or .cse1 .cse2 (and .cse18 .cse19 .cse34) .cse3 .cse4 .cse35 .cse5 .cse7 .cse36 .cse9 .cse26 .cse27 .cse10 .cse11 .cse22 .cse23 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse1 .cse29 .cse2 .cse3 .cse4 .cse35 .cse5 .cse7 .cse33 .cse36 .cse8 .cse9 .cse27 .cse10 .cse11 (and .cse18 .cse31 .cse34) .cse23 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse25 .cse2 .cse3 .cse4 .cse35 .cse5 .cse7 .cse9 .cse26 .cse27 .cse10 .cse11 .cse12 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32)))) .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse35 .cse5 .cse7 .cse9 .cse26 .cse10 .cse11 .cse22 .cse12 .cse23 .cse13 .cse14 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) .cse37 .cse15 .cse17) (or .cse1 .cse29 .cse2 .cse3 .cse21 .cse4 .cse5 .cse7 .cse33 .cse8 .cse9 .cse10 .cse11 .cse23 .cse13 .cse14 .cse24 .cse15 (and .cse18 .cse20 .cse31) .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse15 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse26 .cse10 .cse11 .cse22 .cse28 .cse12 .cse23 .cse13 .cse14 .cse37 .cse15 .cse17)))) [2023-12-22 02:30:00,571 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2023-12-22 02:30:00,571 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2023-12-22 02:30:00,571 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2023-12-22 02:30:00,571 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 84 108) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse3 (not (= ~q_free~0 (_ bv0 32)))) (.cse10 (= (_ bv2 32) ~c_dr_st~0)) (.cse11 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse0 (not (= (_ bv2 32) ~M_E~0))) (.cse1 (not (= (_ bv2 32) ~T1_E~0))) (.cse2 (not (= (_ bv0 32) ~m_pc~0))) (.cse4 (not (= (_ bv2 32) ~T2_E~0))) (.cse5 (not (= (_ bv2 32) ~E_1~0))) (.cse6 (not (= (_ bv2 32) ~E_M~0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= (_ bv2 32) ~E_2~0)))) (and (or .cse0 (not (= ~p_dw_pc~0 (_ bv0 32))) (not (= ~p_num_write~0 (_ bv1 32))) .cse1 (not (= ~c_num_read~0 (_ bv0 32))) (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_dr_st~0 (_ bv0 32)) .cse8 .cse9) (or .cse10 .cse7 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) .cse5 .cse6 .cse10 .cse11 .cse8 .cse9) (or .cse0 (not (= ~p_num_write~0 ~c_num_read~0)) .cse1 .cse2 .cse4 (and (= ~p_dw_st~0 (_ bv2 32)) (= |old(~c_dr_st~0)| ~c_dr_st~0)) .cse5 .cse6 .cse8 .cse9 (not (= (_ bv2 32) |old(~p_dw_st~0)|)) (not (= ~q_free~0 (_ bv1 32))) (not (= ~p_last_write~0 ~c_last_read~0))))) [2023-12-22 02:30:00,571 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2023-12-22 02:30:00,571 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 104) no Hoare annotation was computed. [2023-12-22 02:30:00,571 INFO L899 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2023-12-22 02:30:00,571 INFO L899 garLoopResultBuilder]: For program point L100-2(lines 84 108) no Hoare annotation was computed. [2023-12-22 02:30:00,571 INFO L899 garLoopResultBuilder]: For program point L61(lines 49 63) no Hoare annotation was computed. [2023-12-22 02:30:00,571 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2023-12-22 02:30:00,572 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 96) no Hoare annotation was computed. [2023-12-22 02:30:00,572 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2023-12-22 02:30:00,572 INFO L899 garLoopResultBuilder]: For program point L80(lines 68 82) no Hoare annotation was computed. [2023-12-22 02:30:00,572 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2023-12-22 02:30:00,572 INFO L899 garLoopResultBuilder]: For program point L729-1(lines 713 746) no Hoare annotation was computed. [2023-12-22 02:30:00,572 INFO L899 garLoopResultBuilder]: For program point L719-1(lines 713 746) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 710 747) the Hoare annotation is: (let ((.cse27 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse28 (not (= (_ bv0 32) ~m_st~0))) (.cse29 (not (= (_ bv0 32) ~m_pc~0))) (.cse24 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse8 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse25 (not (= ~local~0 ~token~0))) (.cse16 (not (= ~t2_st~0 (_ bv0 32)))) (.cse22 (not (= ~t1_st~0 (_ bv2 32)))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not (= (_ bv2 32) |old(~E_M~0)|))) (.cse2 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse23 (not (= ~t2_st~0 (_ bv2 32)))) (.cse3 (not (= (_ bv2 32) |old(~E_1~0)|))) (.cse4 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse5 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse6 (not (= (_ bv1 32) ~t1_i~0))) (.cse7 (not (= (_ bv2 32) |old(~E_2~0)|))) (.cse9 (not (= ~q_free~0 (_ bv0 32)))) (.cse26 (not (= ~t2_pc~0 (_ bv1 32)))) (.cse10 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse11 (and (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T2_E~0) (= (_ bv2 32) ~E_2~0) (= (_ bv2 32) ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (= (_ bv2 32) ~E_1~0))) (.cse12 (= (_ bv1 32) ~m_pc~0)) (.cse13 (not (= ~t1_st~0 (_ bv0 32)))) (.cse14 (not (= (_ bv2 32) |old(~T2_E~0)|))) (.cse15 (not (= (_ bv2 32) |old(~T1_E~0)|))) (.cse17 (not (= (_ bv1 32) ~t2_i~0))) (.cse18 (not (= (_ bv2 32) ~m_st~0))) (.cse19 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse20 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse21 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse22 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse27 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse22 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse28 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse29 .cse9 .cse26 .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse19 .cse27 .cse20 .cse21) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse8 .cse25 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse22 .cse19 .cse20 .cse21) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse29 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse27 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse22 .cse18 .cse19 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) .cse20 .cse21) (or .cse0 .cse28 .cse1 .cse2 .cse23 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse14 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32)))) .cse15 .cse17 .cse22 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse20 .cse21) (or .cse0 .cse28 .cse1 .cse2 .cse23 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse25 .cse29 .cse9 .cse26 .cse10 .cse11 .cse14 .cse15 .cse17 .cse22 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse22 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21))) [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point L734-1(lines 713 746) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point L724-1(lines 713 746) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point L714-1(lines 713 746) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 710 747) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point L739-1(lines 710 747) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point L803-2(lines 803 807) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 799) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point L795-2(lines 795 799) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 561) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point L585(lines 573 587) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 545) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point L536-2(lines 536 545) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point L574(lines 574 583) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point L574-2(lines 574 583) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point L537(lines 537 542) no Hoare annotation was computed. [2023-12-22 02:30:00,573 INFO L899 garLoopResultBuilder]: For program point L566(lines 554 568) no Hoare annotation was computed. [2023-12-22 02:30:00,574 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 786 819) the Hoare annotation is: (let ((.cse37 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse27 (= ~t1_st~0 (_ bv2 32))) (.cse41 (= |old(~t2_st~0)| ~t2_st~0)) (.cse19 (= ~t2_st~0 (_ bv2 32))) (.cse20 (= ~t1_st~0 (_ bv0 32))) (.cse26 (= (_ bv2 32) ~m_st~0))) (let ((.cse28 (and .cse19 .cse20 .cse26)) (.cse36 (not (= ~local~0 ~token~0))) (.cse34 (and .cse26 .cse27 .cse41)) (.cse33 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse30 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse25 (not (= (_ bv2 32) |old(~t1_st~0)|))) (.cse39 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32))))) (.cse29 (not (= |old(~t2_st~0)| (_ bv0 32)))) (.cse21 (not (= (_ bv0 32) |old(~t1_st~0)|))) (.cse38 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse24 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse18 (= |old(~m_st~0)| ~m_st~0)) (.cse32 (= ~t2_st~0 (_ bv0 32))) (.cse16 (not (= (_ bv2 32) ~E_2~0))) (.cse6 (and .cse37 .cse26 .cse41)) (.cse8 (not (= (_ bv0 32) ~m_pc~0))) (.cse0 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse2 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse3 (not (= (_ bv2 32) ~T1_E~0))) (.cse4 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse5 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse7 (not (= (_ bv1 32) ~t1_i~0))) (.cse9 (not (= ~q_free~0 (_ bv0 32)))) (.cse31 (not (= ~t2_pc~0 (_ bv1 32)))) (.cse10 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse11 (not (= (_ bv2 32) ~T2_E~0))) (.cse22 (not (= |old(~t2_st~0)| (_ bv2 32)))) (.cse35 (= (_ bv1 32) ~m_pc~0)) (.cse12 (not (= (_ bv2 32) ~E_1~0))) (.cse23 (not (= (_ bv2 32) ~E_M~0))) (.cse13 (not (= (_ bv1 32) ~t2_i~0))) (.cse14 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse40 (and .cse19 .cse37 .cse26)) (.cse15 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse1 (and .cse18 .cse19 .cse20) .cse2 .cse3 .cse21 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse23 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse25 .cse10 .cse11 .cse22 .cse12 .cse23 .cse13 .cse14 (and .cse19 .cse26 .cse27) .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse22 .cse12 .cse28 .cse23 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse29 .cse2 .cse3 .cse4 .cse30 .cse5 .cse7 .cse9 .cse31 (and .cse32 .cse26 .cse27) .cse25 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse33 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse31 .cse25 .cse10 .cse11 .cse35 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse30 .cse5 .cse7 .cse36 .cse9 .cse31 .cse10 .cse11 .cse22 .cse12 .cse28 .cse23 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse29 .cse2 .cse3 .cse4 .cse5 .cse7 (and .cse37 .cse32 .cse26) .cse38 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse15 .cse17) (or .cse1 .cse2 (and .cse18 .cse19 .cse27) .cse3 .cse4 .cse30 .cse5 .cse7 .cse36 .cse9 .cse31 .cse25 .cse10 .cse11 .cse22 .cse23 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse1 .cse29 .cse2 .cse3 .cse4 .cse30 .cse5 .cse7 .cse38 .cse36 .cse8 .cse9 .cse25 .cse10 .cse11 (and .cse18 .cse32 .cse27) .cse23 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse30 .cse5 .cse7 .cse9 .cse31 .cse25 .cse10 .cse11 .cse12 .cse39 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse30 .cse5 .cse7 .cse9 .cse31 .cse10 .cse11 .cse22 .cse12 .cse23 .cse13 .cse14 .cse33 .cse40 .cse15 .cse17) (or (not (= |old(~m_st~0)| (_ bv0 32))) .cse1 .cse2 (and .cse19 (= (_ bv0 32) ~m_st~0) .cse27) .cse3 .cse4 .cse30 .cse5 .cse7 .cse9 .cse31 .cse25 .cse10 .cse11 .cse22 .cse12 .cse39 .cse23 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse1 .cse29 .cse2 .cse3 .cse21 .cse4 .cse5 .cse7 .cse38 .cse8 .cse9 .cse10 .cse11 .cse23 .cse13 .cse14 .cse24 .cse15 (and .cse18 .cse20 .cse32) .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse15 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse31 .cse10 .cse11 .cse22 .cse35 .cse12 .cse23 .cse13 .cse14 .cse40 .cse15 .cse17)))) [2023-12-22 02:30:00,574 INFO L899 garLoopResultBuilder]: For program point L575(lines 575 580) no Hoare annotation was computed. [2023-12-22 02:30:00,574 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 786 819) no Hoare annotation was computed. [2023-12-22 02:30:00,574 INFO L899 garLoopResultBuilder]: For program point L555(lines 555 564) no Hoare annotation was computed. [2023-12-22 02:30:00,574 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 815) no Hoare annotation was computed. [2023-12-22 02:30:00,575 INFO L899 garLoopResultBuilder]: For program point L555-2(lines 555 564) no Hoare annotation was computed. [2023-12-22 02:30:00,575 INFO L899 garLoopResultBuilder]: For program point L811-2(lines 786 819) no Hoare annotation was computed. [2023-12-22 02:30:00,575 INFO L899 garLoopResultBuilder]: For program point L547(lines 535 549) no Hoare annotation was computed. [2023-12-22 02:30:00,575 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 807) no Hoare annotation was computed. [2023-12-22 02:30:00,575 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 589 596) no Hoare annotation was computed. [2023-12-22 02:30:00,575 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 589 596) the Hoare annotation is: true [2023-12-22 02:30:00,575 INFO L895 garLoopResultBuilder]: At program point L895(line 895) the Hoare annotation is: (let ((.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse22 (= (_ bv0 32) ~m_st~0)) (.cse25 (= (_ bv0 32) ~m_pc~0)) (.cse27 (= ~t1_st~0 (_ bv2 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse26 (= ~t1_pc~0 (_ bv0 32))) (.cse28 (not (= (_ bv1 32) ~m_pc~0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_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 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~T1_E~0)) (.cse23 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~m_st~0)) (.cse17 (= ~local~0 ~token~0)) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse19 (= (_ bv1 32) ~t1_i~0)) (.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse21 (= ~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) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse18 .cse19 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2023-12-22 02:30:00,575 INFO L899 garLoopResultBuilder]: For program point L895-1(line 895) no Hoare annotation was computed. [2023-12-22 02:30:00,575 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 109 151) no Hoare annotation was computed. [2023-12-22 02:30:00,575 INFO L899 garLoopResultBuilder]: For program point L664(lines 664 671) no Hoare annotation was computed. [2023-12-22 02:30:00,575 INFO L899 garLoopResultBuilder]: For program point L664-2(lines 664 671) no Hoare annotation was computed. [2023-12-22 02:30:00,576 INFO L899 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2023-12-22 02:30:00,576 INFO L899 garLoopResultBuilder]: For program point L500(lines 500 508) no Hoare annotation was computed. [2023-12-22 02:30:00,576 INFO L899 garLoopResultBuilder]: For program point L467(lines 467 471) no Hoare annotation was computed. [2023-12-22 02:30:00,578 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2023-12-22 02:30:00,578 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2023-12-22 02:30:00,578 INFO L899 garLoopResultBuilder]: For program point L897(lines 897 902) no Hoare annotation was computed. [2023-12-22 02:30:00,579 INFO L899 garLoopResultBuilder]: For program point L864-1(lines 843 876) no Hoare annotation was computed. [2023-12-22 02:30:00,579 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 460 495) no Hoare annotation was computed. [2023-12-22 02:30:00,579 INFO L895 garLoopResultBuilder]: At program point L931(line 931) the Hoare annotation is: (let ((.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse22 (= (_ bv0 32) ~m_st~0)) (.cse25 (= (_ bv0 32) ~m_pc~0)) (.cse27 (= ~t1_st~0 (_ bv2 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse26 (= ~t1_pc~0 (_ bv0 32))) (.cse28 (not (= (_ bv1 32) ~m_pc~0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_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 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~T1_E~0)) (.cse23 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~m_st~0)) (.cse17 (= ~local~0 ~token~0)) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse19 (= (_ bv1 32) ~t1_i~0)) (.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse21 (= ~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) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse18 .cse19 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2023-12-22 02:30:00,579 INFO L899 garLoopResultBuilder]: For program point L931-1(line 931) no Hoare annotation was computed. [2023-12-22 02:30:00,579 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 605) no Hoare annotation was computed. [2023-12-22 02:30:00,579 INFO L899 garLoopResultBuilder]: For program point L601-2(lines 600 618) no Hoare annotation was computed. [2023-12-22 02:30:00,579 INFO L899 garLoopResultBuilder]: For program point L503(lines 503 507) no Hoare annotation was computed. [2023-12-22 02:30:00,579 INFO L895 garLoopResultBuilder]: At program point L437(line 437) the Hoare annotation is: (let ((.cse10 (= ~t2_st~0 (_ bv0 32))) (.cse13 (= ~t2_pc~0 (_ bv0 32))) (.cse7 (= ~t1_st~0 (_ bv0 32))) (.cse14 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~t1_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 (= ~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)) (.cse23 (= ~t2_st~0 (_ bv2 32))) (.cse8 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse20 (= ~local~0 ~token~0)) (.cse21 (= ~t1_st~0 (_ bv2 32))) (.cse22 (= ~t1_pc~0 (_ bv1 32))) (.cse16 (= (_ 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 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20 .cse21 .cse22 .cse16 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 (= ~t2_pc~0 (_ bv1 32)) .cse3 .cse4 .cse5 .cse6 .cse23 .cse8 .cse9 .cse11 .cse12 .cse15 .cse20 .cse21 .cse22 .cse16 .cse18 .cse19))) [2023-12-22 02:30:00,579 INFO L899 garLoopResultBuilder]: For program point L437-1(line 437) no Hoare annotation was computed. [2023-12-22 02:30:00,580 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2023-12-22 02:30:00,580 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 908 966) no Hoare annotation was computed. [2023-12-22 02:30:00,580 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 416 459) no Hoare annotation was computed. [2023-12-22 02:30:00,580 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 321 349) no Hoare annotation was computed. [2023-12-22 02:30:00,580 INFO L895 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (let ((.cse9 (= (_ bv2 32) ~c_dr_st~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~E_2~0)) (.cse4 (= (_ bv2 32) ~M_E~0)) (.cse5 (= ~q_free~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse10 (= ~c_dr_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse9) (and .cse0 .cse1 .cse2 (= ~p_num_write~0 (_ bv1 32)) (= ~c_num_read~0 (_ bv0 32)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))))) [2023-12-22 02:30:00,580 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2023-12-22 02:30:00,580 INFO L895 garLoopResultBuilder]: At program point L935(line 935) the Hoare annotation is: (let ((.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse22 (= (_ bv0 32) ~m_st~0)) (.cse25 (= (_ bv0 32) ~m_pc~0)) (.cse27 (= ~t1_st~0 (_ bv2 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse26 (= ~t1_pc~0 (_ bv0 32))) (.cse28 (not (= (_ bv1 32) ~m_pc~0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_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 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~T1_E~0)) (.cse23 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~m_st~0)) (.cse17 (= ~local~0 ~token~0)) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse19 (= (_ bv1 32) ~t1_i~0)) (.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse21 (= ~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) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse18 .cse19 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2023-12-22 02:30:00,580 INFO L895 garLoopResultBuilder]: At program point L935-1(line 935) the Hoare annotation is: (let ((.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse22 (= (_ bv0 32) ~m_st~0)) (.cse25 (= (_ bv0 32) ~m_pc~0)) (.cse27 (= ~t1_st~0 (_ bv2 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse26 (= ~t1_pc~0 (_ bv0 32))) (.cse28 (not (= (_ bv1 32) ~m_pc~0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_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 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~T1_E~0)) (.cse23 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~m_st~0)) (.cse17 (= ~local~0 ~token~0)) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse19 (= (_ bv1 32) ~t1_i~0)) (.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse21 (= ~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) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse18 .cse19 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2023-12-22 02:30:00,580 INFO L899 garLoopResultBuilder]: For program point L869-1(lines 840 877) no Hoare annotation was computed. [2023-12-22 02:30:00,581 INFO L895 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse11 (= ~p_num_write~0 ~c_num_read~0)) (.cse19 (= ~q_free~0 (_ bv0 32))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse10 (= (_ 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)) (.cse14 (= ~c_num_read~0 (_ bv0 32))) (.cse15 (= ~p_num_write~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~E_2~0)) (.cse4 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse16 (= ~p_last_write~0 ~c_last_read~0)) (.cse6 (= ~p_dw_st~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse9 (= ~q_free~0 (_ bv1 32))) (.cse17 (= ~c_dr_st~0 (_ bv0 32))) (.cse18 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse4 .cse5 .cse12 .cse16 .cse7 .cse8 .cse13 .cse9 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse19 .cse5 .cse12 .cse7 .cse8 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse12 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse13 .cse9 .cse17 .cse18))) [2023-12-22 02:30:00,581 INFO L899 garLoopResultBuilder]: For program point L308-1(line 308) no Hoare annotation was computed. [2023-12-22 02:30:00,581 INFO L895 garLoopResultBuilder]: At program point L936(line 936) the Hoare annotation is: (let ((.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse22 (= (_ bv0 32) ~m_st~0)) (.cse25 (= (_ bv0 32) ~m_pc~0)) (.cse27 (= ~t1_st~0 (_ bv2 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse26 (= ~t1_pc~0 (_ bv0 32))) (.cse28 (not (= (_ bv1 32) ~m_pc~0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_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 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~T1_E~0)) (.cse23 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~m_st~0)) (.cse17 (= ~local~0 ~token~0)) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse19 (= (_ bv1 32) ~t1_i~0)) (.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse21 (= ~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) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse18 .cse19 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2023-12-22 02:30:00,581 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 645 709) no Hoare annotation was computed. [2023-12-22 02:30:00,581 INFO L899 garLoopResultBuilder]: For program point L606-1(lines 600 618) no Hoare annotation was computed. [2023-12-22 02:30:00,581 INFO L895 garLoopResultBuilder]: At program point L937(line 937) the Hoare annotation is: (let ((.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse22 (= (_ bv0 32) ~m_st~0)) (.cse25 (= (_ bv0 32) ~m_pc~0)) (.cse27 (= ~t1_st~0 (_ bv2 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse26 (= ~t1_pc~0 (_ bv0 32))) (.cse28 (not (= (_ bv1 32) ~m_pc~0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_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 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~T1_E~0)) (.cse23 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~m_st~0)) (.cse17 (= ~local~0 ~token~0)) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse19 (= (_ bv1 32) ~t1_i~0)) (.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse21 (= ~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) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse18 .cse19 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2023-12-22 02:30:00,581 INFO L899 garLoopResultBuilder]: For program point L904(lines 893 906) no Hoare annotation was computed. [2023-12-22 02:30:00,581 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 153 209) no Hoare annotation was computed. [2023-12-22 02:30:00,581 INFO L895 garLoopResultBuilder]: At program point L475-1(lines 475 488) the Hoare annotation is: (let ((.cse10 (= (_ bv0 32) ~m_st~0)) (.cse17 (= ~local~0 ~token~0)) (.cse22 (= ~t2_pc~0 (_ bv0 32))) (.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse21 (= ~t2_st~0 (_ bv0 32))) (.cse15 (= (_ bv0 32) ~m_pc~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_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 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~T1_E~0)) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse16 (= ~c_dr_pc~0 (_ bv0 32))) (.cse23 (= (_ bv2 32) ~m_st~0)) (.cse18 (= (_ bv1 32) ~t1_i~0)) (.cse19 (= ~c_dr_st~0 (_ bv0 32))) (.cse20 (= ~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) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13 .cse22 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse21 .cse12 .cse13 .cse14 .cse16 .cse23 (not (= (_ bv1 32) ~m_pc~0)) .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse21 .cse12 .cse13 .cse22 .cse14 .cse16 .cse23 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse21 .cse12 .cse13 .cse14 .cse16 .cse23 (= ~t1_pc~0 (_ bv1 32)) .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse23 .cse18 .cse19 .cse20))) [2023-12-22 02:30:00,581 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 315) no Hoare annotation was computed. [2023-12-22 02:30:00,582 INFO L899 garLoopResultBuilder]: For program point transmit2_returnLabel#1(lines 496 531) no Hoare annotation was computed. [2023-12-22 02:30:00,582 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 248 301) no Hoare annotation was computed. [2023-12-22 02:30:00,582 INFO L899 garLoopResultBuilder]: For program point L675-1(lines 651 703) no Hoare annotation was computed. [2023-12-22 02:30:00,582 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2023-12-22 02:30:00,582 INFO L899 garLoopResultBuilder]: For program point L940(line 940) no Hoare annotation was computed. [2023-12-22 02:30:00,582 INFO L895 garLoopResultBuilder]: At program point L511-1(lines 511 524) the Hoare annotation is: (let ((.cse23 (= ~t1_pc~0 (_ bv0 32))) (.cse8 (= (_ bv0 32) ~m_st~0)) (.cse16 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= (_ bv0 32) ~m_pc~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_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)) (.cse22 (= ~t1_st~0 (_ bv0 32))) (.cse7 (= ~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)) (.cse14 (= ~c_dr_pc~0 (_ bv0 32))) (.cse21 (= (_ bv2 32) ~m_st~0)) (.cse15 (= ~local~0 ~token~0)) (.cse17 (= ~t1_pc~0 (_ bv1 32))) (.cse18 (= (_ bv1 32) ~t1_i~0)) (.cse19 (= ~c_dr_st~0 (_ bv0 32))) (.cse20 (= ~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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse21 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse21 .cse18 .cse23 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse23 .cse19 .cse20) (and .cse0 .cse1 .cse2 (= ~t2_pc~0 (_ bv1 32)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse21 (not (= (_ bv1 32) ~m_pc~0)) .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse21 .cse15 .cse17 .cse18 .cse19 .cse20))) [2023-12-22 02:30:00,582 INFO L895 garLoopResultBuilder]: At program point L445-1(lines 431 452) the Hoare annotation is: (let ((.cse21 (= ~t2_st~0 (_ bv0 32))) (.cse22 (= ~t2_pc~0 (_ bv0 32))) (.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse25 (= ~local~0 ~token~0)) (.cse15 (= ~t1_st~0 (_ bv2 32))) (.cse16 (= ~t1_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)) (.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))) (.cse20 (= ~t1_st~0 (_ bv0 32))) (.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)) (.cse23 (= (_ bv0 32) ~m_pc~0)) (.cse14 (= ~c_dr_pc~0 (_ bv0 32))) (.cse17 (= (_ bv1 32) ~t1_i~0)) (.cse24 (= ~t1_pc~0 (_ bv0 32))) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse19 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse21 .cse11 .cse12 .cse22 .cse13 .cse23 .cse14 .cse17 .cse24 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse21 .cse11 .cse12 .cse22 .cse13 .cse23 .cse14 .cse25 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse14 .cse25 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse14 .cse17 .cse24 .cse18 .cse19))) [2023-12-22 02:30:00,582 INFO L895 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse11 (= ~p_num_write~0 ~c_num_read~0)) (.cse19 (= ~q_free~0 (_ bv0 32))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse10 (= (_ 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)) (.cse14 (= ~c_num_read~0 (_ bv0 32))) (.cse15 (= ~p_num_write~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~E_2~0)) (.cse4 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse16 (= ~p_last_write~0 ~c_last_read~0)) (.cse6 (= ~p_dw_st~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse9 (= ~q_free~0 (_ bv1 32))) (.cse17 (= ~c_dr_st~0 (_ bv0 32))) (.cse18 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse4 .cse5 .cse12 .cse16 .cse7 .cse8 .cse13 .cse9 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse19 .cse5 .cse12 .cse7 .cse8 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse12 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse13 .cse9 .cse17 .cse18))) [2023-12-22 02:30:00,582 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 218) no Hoare annotation was computed. [2023-12-22 02:30:00,582 INFO L899 garLoopResultBuilder]: For program point L214-2(lines 213 226) no Hoare annotation was computed. [2023-12-22 02:30:00,582 INFO L899 garLoopResultBuilder]: For program point L611-1(lines 597 619) no Hoare annotation was computed. [2023-12-22 02:30:00,582 INFO L899 garLoopResultBuilder]: For program point L942(lines 942 951) no Hoare annotation was computed. [2023-12-22 02:30:00,582 INFO L899 garLoopResultBuilder]: For program point L942-2(lines 942 951) no Hoare annotation was computed. [2023-12-22 02:30:00,582 INFO L899 garLoopResultBuilder]: For program point L678(lines 678 685) no Hoare annotation was computed. [2023-12-22 02:30:00,583 INFO L899 garLoopResultBuilder]: For program point L678-2(lines 678 685) no Hoare annotation was computed. [2023-12-22 02:30:00,583 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2023-12-22 02:30:00,583 INFO L899 garLoopResultBuilder]: For program point L844(lines 844 848) no Hoare annotation was computed. [2023-12-22 02:30:00,583 INFO L899 garLoopResultBuilder]: For program point L844-2(lines 843 876) no Hoare annotation was computed. [2023-12-22 02:30:00,583 INFO L899 garLoopResultBuilder]: For program point L317(lines 306 319) no Hoare annotation was computed. [2023-12-22 02:30:00,583 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2023-12-22 02:30:00,583 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 210 227) no Hoare annotation was computed. [2023-12-22 02:30:00,583 INFO L899 garLoopResultBuilder]: For program point L979(lines 979 985) no Hoare annotation was computed. [2023-12-22 02:30:00,583 INFO L895 garLoopResultBuilder]: At program point L946(line 946) the Hoare annotation is: (let ((.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse22 (= (_ bv0 32) ~m_st~0)) (.cse25 (= (_ bv0 32) ~m_pc~0)) (.cse27 (= ~t1_st~0 (_ bv2 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse26 (= ~t1_pc~0 (_ bv0 32))) (.cse28 (not (= (_ bv1 32) ~m_pc~0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_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 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~T1_E~0)) (.cse23 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~m_st~0)) (.cse17 (= ~local~0 ~token~0)) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse19 (= (_ bv1 32) ~t1_i~0)) (.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse21 (= ~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) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse18 .cse19 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2023-12-22 02:30:00,583 INFO L899 garLoopResultBuilder]: For program point L946-1(line 946) no Hoare annotation was computed. [2023-12-22 02:30:00,583 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) ~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) (= ~q_free~0 (_ bv1 32)) (= ~p_num_write~0 ~c_num_read~0)) [2023-12-22 02:30:00,583 INFO L899 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2023-12-22 02:30:00,583 INFO L895 garLoopResultBuilder]: At program point L485(line 485) the Hoare annotation is: (let ((.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse7 (= ~t2_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)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.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 (= (_ bv1 32) ~t1_i~0)) (.cse16 (= ~c_dr_st~0 (_ bv0 32))) (.cse17 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= (_ bv1 32) ~m_pc~0)) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 (= (_ bv0 32) ~m_pc~0) .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~t1_pc~0 (_ bv1 32)) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 (= ~t2_st~0 (_ bv0 32)) .cse10 .cse11 (= ~t2_pc~0 (_ bv0 32)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-22 02:30:00,584 INFO L899 garLoopResultBuilder]: For program point L485-1(line 485) no Hoare annotation was computed. [2023-12-22 02:30:00,584 INFO L899 garLoopResultBuilder]: For program point L981(lines 981 984) no Hoare annotation was computed. [2023-12-22 02:30:00,584 INFO L899 garLoopResultBuilder]: For program point L849-1(lines 843 876) no Hoare annotation was computed. [2023-12-22 02:30:00,584 INFO L899 garLoopResultBuilder]: For program point L420(lines 420 428) no Hoare annotation was computed. [2023-12-22 02:30:00,584 INFO L895 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T2_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) (= ~q_free~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) (= (_ 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:30:00,584 INFO L899 garLoopResultBuilder]: For program point L916-1(line 916) no Hoare annotation was computed. [2023-12-22 02:30:00,584 INFO L895 garLoopResultBuilder]: At program point L652(line 652) the Hoare annotation is: (let ((.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse22 (= (_ bv0 32) ~m_st~0)) (.cse25 (= (_ bv0 32) ~m_pc~0)) (.cse27 (= ~t1_st~0 (_ bv2 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse26 (= ~t1_pc~0 (_ bv0 32))) (.cse28 (not (= (_ bv1 32) ~m_pc~0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_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 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~T1_E~0)) (.cse23 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~m_st~0)) (.cse17 (= ~local~0 ~token~0)) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse19 (= (_ bv1 32) ~t1_i~0)) (.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse21 (= ~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) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse18 .cse19 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2023-12-22 02:30:00,584 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-22 02:30:00,584 INFO L895 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse11 (= ~p_num_write~0 ~c_num_read~0)) (.cse19 (= ~q_free~0 (_ bv0 32))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse10 (= (_ 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)) (.cse14 (= ~c_num_read~0 (_ bv0 32))) (.cse15 (= ~p_num_write~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~E_2~0)) (.cse4 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse16 (= ~p_last_write~0 ~c_last_read~0)) (.cse6 (= ~p_dw_st~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse9 (= ~q_free~0 (_ bv1 32))) (.cse17 (= ~c_dr_st~0 (_ bv0 32))) (.cse18 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse4 .cse5 .cse12 .cse16 .cse7 .cse8 .cse13 .cse9 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse19 .cse5 .cse12 .cse7 .cse8 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse12 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse13 .cse9 .cse17 .cse18))) [2023-12-22 02:30:00,584 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2023-12-22 02:30:00,584 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2023-12-22 02:30:00,584 INFO L895 garLoopResultBuilder]: At program point L521(line 521) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~T2_E~0)) (.cse2 (= ~t2_pc~0 (_ bv1 32))) (.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 (= ~q_free~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~T1_E~0)) (.cse9 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~E_1~0)) (.cse12 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~m_st~0)) (.cse14 (= ~t1_st~0 (_ bv2 32))) (.cse15 (= (_ bv1 32) ~t1_i~0)) (.cse16 (= ~c_dr_st~0 (_ bv0 32))) (.cse17 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= (_ bv1 32) ~m_pc~0)) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= (_ bv0 32) ~m_pc~0) .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~t1_pc~0 (_ bv1 32)) .cse15 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse16 .cse17))) [2023-12-22 02:30:00,584 INFO L899 garLoopResultBuilder]: For program point L521-1(line 521) no Hoare annotation was computed. [2023-12-22 02:30:00,585 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2023-12-22 02:30:00,585 INFO L895 garLoopResultBuilder]: At program point L125-1(lines 125 145) the Hoare annotation is: (let ((.cse5 (= ~q_free~0 (_ bv0 32))) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse9 (= ~c_dr_st~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) ~E_2~0)) (.cse4 (= (_ bv2 32) ~M_E~0)) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse12 (= ~q_free~0 (_ bv1 32))) (.cse10 (= (_ bv2 32) ~c_dr_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) (and .cse11 .cse10) (and .cse0 .cse1 .cse2 (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) .cse3 .cse4 .cse6 (= ~p_last_write~0 ~c_last_read~0) .cse7 .cse8 .cse11 .cse12 .cse9 (= ~p_dw_pc~0 (_ bv0 32))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse12 .cse10 (= ~p_num_write~0 ~c_num_read~0)))) [2023-12-22 02:30:00,585 INFO L895 garLoopResultBuilder]: At program point L918(line 918) 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 (= ~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 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~M_E~0)) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= (_ bv0 32) ~m_pc~0)) (.cse16 (= ~c_dr_pc~0 (_ bv0 32))) (.cse17 (= (_ bv1 32) ~t1_i~0)) (.cse18 (= ~t1_pc~0 (_ bv0 32))) (.cse19 (= ~c_dr_st~0 (_ bv0 32))) (.cse20 (= ~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 (= (_ bv2 32) ~m_st~0) .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (_ bv0 32) ~m_st~0) .cse10 .cse11 .cse12 .cse13 (= ~t2_pc~0 (_ bv0 32)) .cse14 .cse15 .cse16 (= ~local~0 ~token~0) .cse17 .cse18 .cse19 .cse20))) [2023-12-22 02:30:00,585 INFO L895 garLoopResultBuilder]: At program point L918-1(line 918) 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 (= ~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 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~M_E~0)) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= (_ bv0 32) ~m_pc~0)) (.cse16 (= ~c_dr_pc~0 (_ bv0 32))) (.cse17 (= (_ bv1 32) ~t1_i~0)) (.cse18 (= ~t1_pc~0 (_ bv0 32))) (.cse19 (= ~c_dr_st~0 (_ bv0 32))) (.cse20 (= ~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 (= (_ bv2 32) ~m_st~0) .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (_ bv0 32) ~m_st~0) .cse10 .cse11 .cse12 .cse13 (= ~t2_pc~0 (_ bv0 32)) .cse14 .cse15 .cse16 (= ~local~0 ~token~0) .cse17 .cse18 .cse19 .cse20))) [2023-12-22 02:30:00,585 INFO L899 garLoopResultBuilder]: For program point L654(line 654) no Hoare annotation was computed. [2023-12-22 02:30:00,585 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-12-22 02:30:00,585 INFO L899 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2023-12-22 02:30:00,585 INFO L899 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2023-12-22 02:30:00,585 INFO L899 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2023-12-22 02:30:00,585 INFO L895 garLoopResultBuilder]: At program point L919(line 919) 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 (= ~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 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~M_E~0)) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= (_ bv0 32) ~m_pc~0)) (.cse16 (= ~c_dr_pc~0 (_ bv0 32))) (.cse17 (= (_ bv1 32) ~t1_i~0)) (.cse18 (= ~t1_pc~0 (_ bv0 32))) (.cse19 (= ~c_dr_st~0 (_ bv0 32))) (.cse20 (= ~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 (= (_ bv2 32) ~m_st~0) .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (_ bv0 32) ~m_st~0) .cse10 .cse11 .cse12 .cse13 (= ~t2_pc~0 (_ bv0 32)) .cse14 .cse15 .cse16 (= ~local~0 ~token~0) .cse17 .cse18 .cse19 .cse20))) [2023-12-22 02:30:00,585 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 164) no Hoare annotation was computed. [2023-12-22 02:30:00,585 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 135) no Hoare annotation was computed. [2023-12-22 02:30:00,585 INFO L899 garLoopResultBuilder]: For program point L854-1(lines 843 876) no Hoare annotation was computed. [2023-12-22 02:30:00,585 INFO L899 garLoopResultBuilder]: For program point L656(lines 656 660) no Hoare annotation was computed. [2023-12-22 02:30:00,586 INFO L895 garLoopResultBuilder]: At program point L689-1(lines 651 703) the Hoare annotation is: (let ((.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse22 (= (_ bv0 32) ~m_st~0)) (.cse25 (= (_ bv0 32) ~m_pc~0)) (.cse27 (= ~t1_st~0 (_ bv2 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse26 (= ~t1_pc~0 (_ bv0 32))) (.cse28 (not (= (_ bv1 32) ~m_pc~0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_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 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~T1_E~0)) (.cse23 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~m_st~0)) (.cse17 (= ~local~0 ~token~0)) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse19 (= (_ bv1 32) ~t1_i~0)) (.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse21 (= ~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) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse18 .cse19 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2023-12-22 02:30:00,586 INFO L899 garLoopResultBuilder]: For program point L656-1(lines 651 703) no Hoare annotation was computed. [2023-12-22 02:30:00,586 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2023-12-22 02:30:00,586 INFO L899 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2023-12-22 02:30:00,586 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-22 02:30:00,586 INFO L895 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2023-12-22 02:30:00,586 INFO L899 garLoopResultBuilder]: For program point L955(lines 955 959) no Hoare annotation was computed. [2023-12-22 02:30:00,586 INFO L895 garLoopResultBuilder]: At program point L923-1(lines 923 960) the Hoare annotation is: (let ((.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse22 (= (_ bv0 32) ~m_st~0)) (.cse25 (= (_ bv0 32) ~m_pc~0)) (.cse27 (= ~t1_st~0 (_ bv2 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse26 (= ~t1_pc~0 (_ bv0 32))) (.cse28 (not (= (_ bv1 32) ~m_pc~0))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_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 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~T1_E~0)) (.cse23 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~m_st~0)) (.cse17 (= ~local~0 ~token~0)) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse19 (= (_ bv1 32) ~t1_i~0)) (.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse21 (= ~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) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse18 .cse19 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse27 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse26 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse28 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2023-12-22 02:30:00,586 INFO L899 garLoopResultBuilder]: For program point L692(lines 692 699) no Hoare annotation was computed. [2023-12-22 02:30:00,586 INFO L899 garLoopResultBuilder]: For program point L692-2(lines 692 699) no Hoare annotation was computed. [2023-12-22 02:30:00,586 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2023-12-22 02:30:00,586 INFO L899 garLoopResultBuilder]: For program point $Ultimate##104(lines 445 451) no Hoare annotation was computed. [2023-12-22 02:30:00,586 INFO L899 garLoopResultBuilder]: For program point L859-1(lines 843 876) no Hoare annotation was computed. [2023-12-22 02:30:00,586 INFO L899 garLoopResultBuilder]: For program point L661-1(lines 651 703) no Hoare annotation was computed. [2023-12-22 02:30:00,587 INFO L899 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2023-12-22 02:30:00,587 INFO L895 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse11 (= ~p_num_write~0 ~c_num_read~0)) (.cse19 (= ~q_free~0 (_ bv0 32))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse10 (= (_ 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)) (.cse14 (= ~c_num_read~0 (_ bv0 32))) (.cse15 (= ~p_num_write~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~E_2~0)) (.cse4 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse16 (= ~p_last_write~0 ~c_last_read~0)) (.cse6 (= ~p_dw_st~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse9 (= ~q_free~0 (_ bv1 32))) (.cse17 (= ~c_dr_st~0 (_ bv0 32))) (.cse18 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse4 .cse5 .cse12 .cse16 .cse7 .cse8 .cse13 .cse9 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse19 .cse5 .cse12 .cse7 .cse8 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse12 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse13 .cse9 .cse17 .cse18))) [2023-12-22 02:30:00,587 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 472) no Hoare annotation was computed. [2023-12-22 02:30:00,587 INFO L895 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2023-12-22 02:30:00,587 INFO L895 garLoopResultBuilder]: At program point L200-1(lines 168 203) the Hoare annotation is: (let ((.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~q_free~0 (_ bv1 32))) (.cse11 (= ~p_num_write~0 ~c_num_read~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) ~E_2~0)) (.cse4 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse8 (= (_ bv2 32) ~E_1~0)) (.cse9 (= (_ bv0 32) ~m_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (= ~p_dw_st~0 (_ bv0 32)) .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) (= ~q_free~0 (_ bv0 32)) .cse5 .cse6 .cse8 .cse9))) [2023-12-22 02:30:00,587 INFO L899 garLoopResultBuilder]: For program point L244(lines 231 246) no Hoare annotation was computed. [2023-12-22 02:30:00,587 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 241) no Hoare annotation was computed. [2023-12-22 02:30:00,587 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 228 247) the Hoare annotation is: true [2023-12-22 02:30:00,587 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 242) no Hoare annotation was computed. [2023-12-22 02:30:00,587 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2023-12-22 02:30:00,587 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2023-12-22 02:30:00,587 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2023-12-22 02:30:00,587 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2023-12-22 02:30:00,587 INFO L899 garLoopResultBuilder]: For program point L641(lines 623 643) no Hoare annotation was computed. [2023-12-22 02:30:00,587 INFO L899 garLoopResultBuilder]: For program point L632(lines 632 637) no Hoare annotation was computed. [2023-12-22 02:30:00,587 INFO L899 garLoopResultBuilder]: For program point L628(lines 628 638) no Hoare annotation was computed. [2023-12-22 02:30:00,587 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 639) no Hoare annotation was computed. [2023-12-22 02:30:00,588 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 620 644) the Hoare annotation is: true [2023-12-22 02:30:00,588 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 620 644) no Hoare annotation was computed. [2023-12-22 02:30:00,588 INFO L899 garLoopResultBuilder]: For program point L762-1(lines 751 784) no Hoare annotation was computed. [2023-12-22 02:30:00,588 INFO L899 garLoopResultBuilder]: For program point L752-1(lines 751 784) no Hoare annotation was computed. [2023-12-22 02:30:00,588 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 748 785) the Hoare annotation is: (let ((.cse27 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse28 (not (= (_ bv0 32) ~m_st~0))) (.cse29 (not (= (_ bv0 32) ~m_pc~0))) (.cse24 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse8 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse25 (not (= ~local~0 ~token~0))) (.cse16 (not (= ~t2_st~0 (_ bv0 32)))) (.cse22 (not (= ~t1_st~0 (_ bv2 32)))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not (= (_ bv2 32) |old(~E_M~0)|))) (.cse2 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse23 (not (= ~t2_st~0 (_ bv2 32)))) (.cse3 (not (= (_ bv2 32) |old(~E_1~0)|))) (.cse4 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse5 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse6 (not (= (_ bv1 32) ~t1_i~0))) (.cse7 (not (= (_ bv2 32) |old(~E_2~0)|))) (.cse9 (not (= ~q_free~0 (_ bv0 32)))) (.cse26 (not (= ~t2_pc~0 (_ bv1 32)))) (.cse10 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse11 (and (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T2_E~0) (= (_ bv2 32) ~E_2~0) (= (_ bv2 32) ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (= (_ bv2 32) ~E_1~0))) (.cse12 (= (_ bv1 32) ~m_pc~0)) (.cse13 (not (= ~t1_st~0 (_ bv0 32)))) (.cse14 (not (= (_ bv2 32) |old(~T2_E~0)|))) (.cse15 (not (= (_ bv2 32) |old(~T1_E~0)|))) (.cse17 (not (= (_ bv1 32) ~t2_i~0))) (.cse18 (not (= (_ bv2 32) ~m_st~0))) (.cse19 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse20 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse21 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse22 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse27 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse22 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse28 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse29 .cse9 .cse26 .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse19 .cse27 .cse20 .cse21) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse8 .cse25 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse22 .cse19 .cse20 .cse21) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse29 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse27 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse22 .cse18 .cse19 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) .cse20 .cse21) (or .cse0 .cse28 .cse1 .cse2 .cse23 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse14 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32)))) .cse15 .cse17 .cse22 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse20 .cse21) (or .cse0 .cse28 .cse1 .cse2 .cse23 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse25 .cse29 .cse9 .cse26 .cse10 .cse11 .cse14 .cse15 .cse17 .cse22 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse22 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21))) [2023-12-22 02:30:00,588 INFO L899 garLoopResultBuilder]: For program point L777-1(lines 748 785) no Hoare annotation was computed. [2023-12-22 02:30:00,588 INFO L899 garLoopResultBuilder]: For program point L767-1(lines 751 784) no Hoare annotation was computed. [2023-12-22 02:30:00,588 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 748 785) no Hoare annotation was computed. [2023-12-22 02:30:00,588 INFO L899 garLoopResultBuilder]: For program point L757-1(lines 751 784) no Hoare annotation was computed. [2023-12-22 02:30:00,588 INFO L899 garLoopResultBuilder]: For program point L772-1(lines 751 784) no Hoare annotation was computed. [2023-12-22 02:30:00,591 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:30:00,592 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 02:30:00,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 02:30:00 BoogieIcfgContainer [2023-12-22 02:30:00,627 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 02:30:00,627 INFO L158 Benchmark]: Toolchain (without parser) took 59960.73ms. Allocated memory was 325.1MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 275.2MB in the beginning and 1.1GB in the end (delta: -806.0MB). Peak memory consumption was 850.8MB. Max. memory is 8.0GB. [2023-12-22 02:30:00,627 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 231.7MB. Free memory is still 182.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 02:30:00,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.72ms. Allocated memory is still 325.1MB. Free memory was 274.9MB in the beginning and 256.7MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-22 02:30:00,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.36ms. Allocated memory is still 325.1MB. Free memory was 256.7MB in the beginning and 254.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-22 02:30:00,627 INFO L158 Benchmark]: Boogie Preprocessor took 46.98ms. Allocated memory is still 325.1MB. Free memory was 254.0MB in the beginning and 250.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-22 02:30:00,628 INFO L158 Benchmark]: RCFGBuilder took 569.30ms. Allocated memory is still 325.1MB. Free memory was 250.4MB in the beginning and 268.7MB in the end (delta: -18.3MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. [2023-12-22 02:30:00,628 INFO L158 Benchmark]: TraceAbstraction took 58951.44ms. Allocated memory was 325.1MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 268.2MB in the beginning and 1.1GB in the end (delta: -813.1MB). Peak memory consumption was 842.6MB. Max. memory is 8.0GB. [2023-12-22 02:30:00,628 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.14ms. Allocated memory is still 231.7MB. Free memory is still 182.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 329.72ms. Allocated memory is still 325.1MB. Free memory was 274.9MB in the beginning and 256.7MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.36ms. Allocated memory is still 325.1MB. Free memory was 256.7MB in the beginning and 254.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.98ms. Allocated memory is still 325.1MB. Free memory was 254.0MB in the beginning and 250.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 569.30ms. Allocated memory is still 325.1MB. Free memory was 250.4MB in the beginning and 268.7MB in the end (delta: -18.3MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. * TraceAbstraction took 58951.44ms. Allocated memory was 325.1MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 268.2MB in the beginning and 1.1GB in the end (delta: -813.1MB). Peak memory consumption was 842.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 390]: 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, 181 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 58.9s, OverallIterations: 36, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 35.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6374 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6260 mSDsluCounter, 15321 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7892 mSDsCounter, 449 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3944 IncrementalHoareTripleChecker+Invalid, 4393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 449 mSolverCounterUnsat, 7429 mSDtfsCounter, 3944 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3546 GetRequests, 3471 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5977occurred in iteration=30, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 691 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 3932 PreInvPairs, 4512 NumberOfFragments, 20216 HoareAnnotationTreeSize, 3932 FormulaSimplifications, 978 FormulaSimplificationTreeSizeReduction, 4.0s HoareSimplificationTime, 39 FormulaSimplificationsInter, 66599 FormulaSimplificationTreeSizeReductionInter, 31.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3266 NumberOfCodeBlocks, 3266 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3531 ConstructedInterpolants, 0 QuantifiedInterpolants, 6134 SizeOfPredicates, 7 NumberOfNonLiveVariables, 7181 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 39 InterpolantComputations, 35 PerfectInterpolantSequences, 1479/1566 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: 431]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_st == 2)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (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)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (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)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (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)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (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)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 923]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_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)) && (local == token)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (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)) && (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)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_st == 2)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (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)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_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)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (((local + 1) % 4294967296) == token)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (t1_st == 2)) && (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)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (t1_st == 2)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (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)) && (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)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (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)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (t1_st == 2)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (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)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_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)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (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)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (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)) && (local == token)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 475]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (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)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (((local + 1) % 4294967296) == token)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (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)) && (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 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (q_free == 1)) && (p_num_write == c_num_read)) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_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)) && (q_free == 1)) && (p_num_write == c_num_read))) || (((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_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))) - InvariantResult [Line: 651]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_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)) && (local == token)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (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)) && (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)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_st == 2)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (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)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_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)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (((local + 1) % 4294967296) == token)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (t1_st == 2)) && (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)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (t1_st == 2)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (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)) && (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)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (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)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (t1_st == 2)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (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)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_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)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (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)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (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)) && (local == token)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (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 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (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)) && (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)) && (q_free == 1)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_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)) && (c_dr_st == 0))) || (((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == E_2)) && (2 == M_E)) && (q_free == 0)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (2 == c_dr_st))) || ((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_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)) && (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 == 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)) && (c_dr_st == 0)) || ((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == E_2)) && (2 == M_E)) && (q_free == 0)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (2 == c_dr_st))) || ((c_dr_pc == 0) && (2 == c_dr_st))) || (((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_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)) && (q_free == 1)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read))) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (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 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (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)) && (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)) && (q_free == 1)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_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)) && (c_dr_st == 0))) || (((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == E_2)) && (2 == M_E)) && (q_free == 0)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (2 == c_dr_st))) || ((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_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)) && (q_free == 1)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_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)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (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)) && (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)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_st == 2)) && (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)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (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)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_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)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_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)) && (local == token)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-22 02:30:00,642 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...