/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_3.cil+token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 02:38:53,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 02:38:53,829 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:38:53,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 02:38:53,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 02:38:53,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 02:38:53,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 02:38:53,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 02:38:53,858 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 02:38:53,861 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 02:38:53,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 02:38:53,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 02:38:53,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 02:38:53,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 02:38:53,863 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 02:38:53,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 02:38:53,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 02:38:53,864 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 02:38:53,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 02:38:53,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 02:38:53,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 02:38:53,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 02:38:53,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 02:38:53,865 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 02:38:53,865 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 02:38:53,865 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 02:38:53,865 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 02:38:53,865 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 02:38:53,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 02:38:53,865 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 02:38:53,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 02:38:53,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 02:38:53,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 02:38:53,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 02:38:53,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:38:53,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 02:38:53,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 02:38:53,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 02:38:53,867 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 02:38:53,867 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 02:38:53,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 02:38:53,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 02:38:53,868 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 02:38:53,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 02:38:53,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 02:38:53,868 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 02:38:53,868 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:38:54,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 02:38:54,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 02:38:54,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 02:38:54,074 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 02:38:54,077 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 02:38:54,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2023-12-22 02:38:55,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 02:38:55,315 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 02:38:55,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2023-12-22 02:38:55,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78bd5f151/b0abb1003ae44535b0688d654d0cd85a/FLAGbab544ecd [2023-12-22 02:38:55,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78bd5f151/b0abb1003ae44535b0688d654d0cd85a [2023-12-22 02:38:55,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 02:38:55,347 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 02:38:55,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 02:38:55,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 02:38:55,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 02:38:55,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:38:55" (1/1) ... [2023-12-22 02:38:55,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f1d6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:38:55, skipping insertion in model container [2023-12-22 02:38:55,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:38:55" (1/1) ... [2023-12-22 02:38:55,383 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 02:38:55,498 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_3.cil+token_ring.01.cil-1.c[911,924] [2023-12-22 02:38:55,537 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_3.cil+token_ring.01.cil-1.c[8416,8429] [2023-12-22 02:38:55,559 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:38:55,578 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 02:38:55,595 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_3.cil+token_ring.01.cil-1.c[911,924] [2023-12-22 02:38:55,624 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_3.cil+token_ring.01.cil-1.c[8416,8429] [2023-12-22 02:38:55,641 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:38:55,659 INFO L206 MainTranslator]: Completed translation [2023-12-22 02:38:55,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:38:55 WrapperNode [2023-12-22 02:38:55,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 02:38:55,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 02:38:55,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 02:38:55,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 02:38:55,668 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:38:55" (1/1) ... [2023-12-22 02:38:55,679 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:38:55" (1/1) ... [2023-12-22 02:38:55,708 INFO L138 Inliner]: procedures = 58, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 428 [2023-12-22 02:38:55,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 02:38:55,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 02:38:55,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 02:38:55,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 02:38:55,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:38:55" (1/1) ... [2023-12-22 02:38:55,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:38:55" (1/1) ... [2023-12-22 02:38:55,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:38:55" (1/1) ... [2023-12-22 02:38:55,748 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:38:55,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:38:55" (1/1) ... [2023-12-22 02:38:55,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:38:55" (1/1) ... [2023-12-22 02:38:55,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:38:55" (1/1) ... [2023-12-22 02:38:55,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:38:55" (1/1) ... [2023-12-22 02:38:55,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:38:55" (1/1) ... [2023-12-22 02:38:55,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:38:55" (1/1) ... [2023-12-22 02:38:55,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 02:38:55,769 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 02:38:55,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 02:38:55,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 02:38:55,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:38:55" (1/1) ... [2023-12-22 02:38:55,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:38:55,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 02:38:55,804 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:38:55,810 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:38:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 02:38:55,826 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-22 02:38:55,826 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-22 02:38:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-22 02:38:55,827 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-22 02:38:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-22 02:38:55,827 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-22 02:38:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-22 02:38:55,827 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-22 02:38:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-12-22 02:38:55,827 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-12-22 02:38:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-22 02:38:55,827 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-22 02:38:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-22 02:38:55,827 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-22 02:38:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-12-22 02:38:55,828 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-12-22 02:38:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 02:38:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-22 02:38:55,828 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-22 02:38:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-12-22 02:38:55,828 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-12-22 02:38:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-22 02:38:55,829 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-22 02:38:55,829 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-22 02:38:55,829 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-22 02:38:55,829 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-12-22 02:38:55,829 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-12-22 02:38:55,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 02:38:55,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 02:38:55,829 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-22 02:38:55,829 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-22 02:38:55,926 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 02:38:55,929 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 02:38:56,234 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1bv32 == ~q_free~0); [2023-12-22 02:38:56,234 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1bv32 == ~q_free~0;~c_dr_st~0 := 2bv32;~c_dr_pc~0 := 2bv32;~a_t~0 := do_read_c_~a~0#1; [2023-12-22 02:38:56,266 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 02:38:56,299 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 02:38:56,299 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-12-22 02:38:56,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:38:56 BoogieIcfgContainer [2023-12-22 02:38:56,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 02:38:56,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 02:38:56,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 02:38:56,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 02:38:56,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 02:38:55" (1/3) ... [2023-12-22 02:38:56,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c46b4f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:38:56, skipping insertion in model container [2023-12-22 02:38:56,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:38:55" (2/3) ... [2023-12-22 02:38:56,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c46b4f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:38:56, skipping insertion in model container [2023-12-22 02:38:56,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:38:56" (3/3) ... [2023-12-22 02:38:56,305 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c [2023-12-22 02:38:56,319 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 02:38:56,319 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-22 02:38:56,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 02:38:56,369 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;@604d6ad1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 02:38:56,369 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-22 02:38:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 199 states, 151 states have (on average 1.6225165562913908) internal successors, (245), 157 states have internal predecessors, (245), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-22 02:38:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 02:38:56,384 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:38:56,385 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] [2023-12-22 02:38:56,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:38:56,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:38:56,389 INFO L85 PathProgramCache]: Analyzing trace with hash 635992734, now seen corresponding path program 1 times [2023-12-22 02:38:56,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:38:56,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356463774] [2023-12-22 02:38:56,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:38:56,398 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:38:56,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:38:56,400 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:38:56,408 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:38:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:38:56,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:38:56,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:38:56,557 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:38:56,558 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:38:56,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:38:56,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356463774] [2023-12-22 02:38:56,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356463774] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:38:56,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:38:56,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:38:56,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861215620] [2023-12-22 02:38:56,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:38:56,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:38:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:38:56,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:38:56,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:38:56,586 INFO L87 Difference]: Start difference. First operand has 199 states, 151 states have (on average 1.6225165562913908) internal successors, (245), 157 states have internal predecessors, (245), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 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:38:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:38:57,065 INFO L93 Difference]: Finished difference Result 475 states and 734 transitions. [2023-12-22 02:38:57,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:38:57,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 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 51 [2023-12-22 02:38:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:38:57,076 INFO L225 Difference]: With dead ends: 475 [2023-12-22 02:38:57,076 INFO L226 Difference]: Without dead ends: 285 [2023-12-22 02:38:57,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 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:38:57,081 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 393 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-22 02:38:57,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 524 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 02:38:57,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-12-22 02:38:57,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 278. [2023-12-22 02:38:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 215 states have (on average 1.4930232558139536) internal successors, (321), 220 states have internal predecessors, (321), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2023-12-22 02:38:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 402 transitions. [2023-12-22 02:38:57,158 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 402 transitions. Word has length 51 [2023-12-22 02:38:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:38:57,158 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 402 transitions. [2023-12-22 02:38:57,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 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:38:57,159 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 402 transitions. [2023-12-22 02:38:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 02:38:57,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:38:57,161 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] [2023-12-22 02:38:57,168 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:38:57,364 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:38:57,365 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:38:57,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:38:57,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1482341282, now seen corresponding path program 1 times [2023-12-22 02:38:57,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:38:57,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574754347] [2023-12-22 02:38:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:38:57,367 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:38:57,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:38:57,369 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:38:57,370 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:38:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:38:57,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:38:57,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:38:57,478 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:38:57,479 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:38:57,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:38:57,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574754347] [2023-12-22 02:38:57,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574754347] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:38:57,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:38:57,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:38:57,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706271372] [2023-12-22 02:38:57,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:38:57,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:38:57,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:38:57,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:38:57,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:38:57,482 INFO L87 Difference]: Start difference. First operand 278 states and 402 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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:38:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:38:57,831 INFO L93 Difference]: Finished difference Result 448 states and 653 transitions. [2023-12-22 02:38:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:38:57,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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 51 [2023-12-22 02:38:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:38:57,833 INFO L225 Difference]: With dead ends: 448 [2023-12-22 02:38:57,833 INFO L226 Difference]: Without dead ends: 278 [2023-12-22 02:38:57,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 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:38:57,835 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 336 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:38:57,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 374 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:38:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2023-12-22 02:38:57,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2023-12-22 02:38:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 215 states have (on average 1.4604651162790698) internal successors, (314), 220 states have internal predecessors, (314), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2023-12-22 02:38:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 395 transitions. [2023-12-22 02:38:57,858 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 395 transitions. Word has length 51 [2023-12-22 02:38:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:38:57,858 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 395 transitions. [2023-12-22 02:38:57,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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:38:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 395 transitions. [2023-12-22 02:38:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 02:38:57,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:38:57,859 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] [2023-12-22 02:38:57,880 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 (3)] Ended with exit code 0 [2023-12-22 02:38:58,062 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:38:58,063 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:38:58,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:38:58,064 INFO L85 PathProgramCache]: Analyzing trace with hash -707114466, now seen corresponding path program 1 times [2023-12-22 02:38:58,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:38:58,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311266694] [2023-12-22 02:38:58,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:38:58,064 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:38:58,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:38:58,066 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:38:58,071 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:38:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:38:58,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:38:58,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:38:58,160 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:38:58,160 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:38:58,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:38:58,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311266694] [2023-12-22 02:38:58,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311266694] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:38:58,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:38:58,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:38:58,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223277518] [2023-12-22 02:38:58,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:38:58,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:38:58,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:38:58,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:38:58,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:38:58,162 INFO L87 Difference]: Start difference. First operand 278 states and 395 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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:38:58,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:38:58,457 INFO L93 Difference]: Finished difference Result 482 states and 691 transitions. [2023-12-22 02:38:58,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:38:58,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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 51 [2023-12-22 02:38:58,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:38:58,460 INFO L225 Difference]: With dead ends: 482 [2023-12-22 02:38:58,460 INFO L226 Difference]: Without dead ends: 312 [2023-12-22 02:38:58,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 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:38:58,463 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 345 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:38:58,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 368 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:38:58,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-12-22 02:38:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2023-12-22 02:38:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 243 states have (on average 1.4197530864197532) internal successors, (345), 248 states have internal predecessors, (345), 43 states have call successors, (43), 24 states have call predecessors, (43), 24 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2023-12-22 02:38:58,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 430 transitions. [2023-12-22 02:38:58,500 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 430 transitions. Word has length 51 [2023-12-22 02:38:58,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:38:58,500 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 430 transitions. [2023-12-22 02:38:58,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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:38:58,501 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 430 transitions. [2023-12-22 02:38:58,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 02:38:58,505 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:38:58,505 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] [2023-12-22 02:38:58,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-22 02:38:58,709 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:38:58,710 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:38:58,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:38:58,710 INFO L85 PathProgramCache]: Analyzing trace with hash 53541922, now seen corresponding path program 1 times [2023-12-22 02:38:58,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:38:58,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79157070] [2023-12-22 02:38:58,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:38:58,711 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:38:58,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:38:58,712 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:38:58,714 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:38:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:38:58,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:38:58,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:38:58,774 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:38:58,774 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:38:58,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:38:58,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79157070] [2023-12-22 02:38:58,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79157070] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:38:58,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:38:58,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:38:58,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772028124] [2023-12-22 02:38:58,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:38:58,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:38:58,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:38:58,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:38:58,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:38:58,776 INFO L87 Difference]: Start difference. First operand 312 states and 430 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:38:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:38:58,838 INFO L93 Difference]: Finished difference Result 535 states and 740 transitions. [2023-12-22 02:38:58,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:38:58,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 51 [2023-12-22 02:38:58,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:38:58,840 INFO L225 Difference]: With dead ends: 535 [2023-12-22 02:38:58,840 INFO L226 Difference]: Without dead ends: 332 [2023-12-22 02:38:58,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 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:38:58,842 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 11 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 757 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:38:58,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 757 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:38:58,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-12-22 02:38:58,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 316. [2023-12-22 02:38:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 247 states have (on average 1.4048582995951417) internal successors, (347), 252 states have internal predecessors, (347), 43 states have call successors, (43), 24 states have call predecessors, (43), 24 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2023-12-22 02:38:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 432 transitions. [2023-12-22 02:38:58,864 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 432 transitions. Word has length 51 [2023-12-22 02:38:58,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:38:58,864 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 432 transitions. [2023-12-22 02:38:58,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:38:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 432 transitions. [2023-12-22 02:38:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 02:38:58,865 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:38:58,865 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] [2023-12-22 02:38:58,876 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:38:59,068 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:38:59,069 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:38:59,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:38:59,069 INFO L85 PathProgramCache]: Analyzing trace with hash 76174176, now seen corresponding path program 1 times [2023-12-22 02:38:59,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:38:59,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031074400] [2023-12-22 02:38:59,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:38:59,070 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:38:59,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:38:59,071 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:38:59,072 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:38:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:38:59,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:38:59,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:38:59,158 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:38:59,159 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:38:59,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:38:59,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031074400] [2023-12-22 02:38:59,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031074400] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:38:59,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:38:59,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:38:59,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635991869] [2023-12-22 02:38:59,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:38:59,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:38:59,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:38:59,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:38:59,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:38:59,165 INFO L87 Difference]: Start difference. First operand 316 states and 432 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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:38:59,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:38:59,242 INFO L93 Difference]: Finished difference Result 681 states and 918 transitions. [2023-12-22 02:38:59,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:38:59,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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 51 [2023-12-22 02:38:59,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:38:59,246 INFO L225 Difference]: With dead ends: 681 [2023-12-22 02:38:59,246 INFO L226 Difference]: Without dead ends: 474 [2023-12-22 02:38:59,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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:38:59,247 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 240 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:38:59,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 389 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:38:59,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2023-12-22 02:38:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 470. [2023-12-22 02:38:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 369 states have (on average 1.3739837398373984) internal successors, (507), 375 states have internal predecessors, (507), 62 states have call successors, (62), 36 states have call predecessors, (62), 37 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2023-12-22 02:38:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 631 transitions. [2023-12-22 02:38:59,282 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 631 transitions. Word has length 51 [2023-12-22 02:38:59,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:38:59,282 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 631 transitions. [2023-12-22 02:38:59,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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:38:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 631 transitions. [2023-12-22 02:38:59,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 02:38:59,284 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:38:59,284 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] [2023-12-22 02:38:59,289 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:38:59,487 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:38:59,487 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:38:59,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:38:59,488 INFO L85 PathProgramCache]: Analyzing trace with hash -232264833, now seen corresponding path program 1 times [2023-12-22 02:38:59,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:38:59,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122903751] [2023-12-22 02:38:59,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:38:59,488 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:38:59,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:38:59,490 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:38:59,491 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:38:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:38:59,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:38:59,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:38:59,554 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:38:59,554 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:38:59,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:38:59,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122903751] [2023-12-22 02:38:59,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122903751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:38:59,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:38:59,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:38:59,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766944602] [2023-12-22 02:38:59,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:38:59,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:38:59,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:38:59,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:38:59,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:38:59,556 INFO L87 Difference]: Start difference. First operand 470 states and 631 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:38:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:38:59,621 INFO L93 Difference]: Finished difference Result 847 states and 1144 transitions. [2023-12-22 02:38:59,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:38:59,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 51 [2023-12-22 02:38:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:38:59,625 INFO L225 Difference]: With dead ends: 847 [2023-12-22 02:38:59,625 INFO L226 Difference]: Without dead ends: 486 [2023-12-22 02:38:59,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 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:38:59,626 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 2 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 766 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:38:59,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 766 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:38:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-12-22 02:38:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 478. [2023-12-22 02:38:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 377 states have (on average 1.3607427055702919) internal successors, (513), 383 states have internal predecessors, (513), 62 states have call successors, (62), 36 states have call predecessors, (62), 37 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2023-12-22 02:38:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 637 transitions. [2023-12-22 02:38:59,655 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 637 transitions. Word has length 51 [2023-12-22 02:38:59,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:38:59,655 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 637 transitions. [2023-12-22 02:38:59,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:38:59,655 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 637 transitions. [2023-12-22 02:38:59,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 02:38:59,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:38:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:38:59,662 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:38:59,860 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:38:59,860 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:38:59,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:38:59,861 INFO L85 PathProgramCache]: Analyzing trace with hash -91716223, now seen corresponding path program 1 times [2023-12-22 02:38:59,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:38:59,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803692162] [2023-12-22 02:38:59,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:38:59,861 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:38:59,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:38:59,862 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:38:59,863 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:38:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:38:59,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:38:59,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:38:59,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:38:59,974 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:38:59,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:38:59,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803692162] [2023-12-22 02:38:59,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803692162] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:38:59,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:38:59,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:38:59,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669493282] [2023-12-22 02:38:59,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:38:59,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:38:59,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:38:59,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:38:59,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:38:59,975 INFO L87 Difference]: Start difference. First operand 478 states and 637 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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:39:00,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:00,047 INFO L93 Difference]: Finished difference Result 1191 states and 1573 transitions. [2023-12-22 02:39:00,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:00,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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 51 [2023-12-22 02:39:00,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:00,052 INFO L225 Difference]: With dead ends: 1191 [2023-12-22 02:39:00,052 INFO L226 Difference]: Without dead ends: 822 [2023-12-22 02:39:00,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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:39:00,054 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 217 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:00,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 351 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2023-12-22 02:39:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 818. [2023-12-22 02:39:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 645 states have (on average 1.3224806201550388) internal successors, (853), 657 states have internal predecessors, (853), 104 states have call successors, (104), 64 states have call predecessors, (104), 67 states have return successors, (106), 98 states have call predecessors, (106), 102 states have call successors, (106) [2023-12-22 02:39:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1063 transitions. [2023-12-22 02:39:00,130 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1063 transitions. Word has length 51 [2023-12-22 02:39:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:00,130 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1063 transitions. [2023-12-22 02:39:00,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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:39:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1063 transitions. [2023-12-22 02:39:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-22 02:39:00,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:00,131 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] [2023-12-22 02:39:00,135 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:39:00,336 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:39:00,336 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:00,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:00,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1245975289, now seen corresponding path program 1 times [2023-12-22 02:39:00,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:00,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323386460] [2023-12-22 02:39:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:00,337 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:39:00,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:00,338 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:39:00,339 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:39:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:00,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 02:39:00,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:00,421 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:39:00,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:00,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:00,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323386460] [2023-12-22 02:39:00,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323386460] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:00,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:00,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 02:39:00,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768155894] [2023-12-22 02:39:00,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:00,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:39:00,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:00,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:39:00,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:39:00,423 INFO L87 Difference]: Start difference. First operand 818 states and 1063 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:39:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:00,751 INFO L93 Difference]: Finished difference Result 1020 states and 1364 transitions. [2023-12-22 02:39:00,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:39:00,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2023-12-22 02:39:00,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:00,756 INFO L225 Difference]: With dead ends: 1020 [2023-12-22 02:39:00,756 INFO L226 Difference]: Without dead ends: 926 [2023-12-22 02:39:00,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:39:00,757 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 270 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:00,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 570 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:39:00,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2023-12-22 02:39:00,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 919. [2023-12-22 02:39:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 724 states have (on average 1.3383977900552486) internal successors, (969), 738 states have internal predecessors, (969), 117 states have call successors, (117), 71 states have call predecessors, (117), 76 states have return successors, (124), 112 states have call predecessors, (124), 115 states have call successors, (124) [2023-12-22 02:39:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1210 transitions. [2023-12-22 02:39:00,810 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1210 transitions. Word has length 57 [2023-12-22 02:39:00,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:00,810 INFO L495 AbstractCegarLoop]: Abstraction has 919 states and 1210 transitions. [2023-12-22 02:39:00,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:39:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1210 transitions. [2023-12-22 02:39:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-22 02:39:00,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:00,811 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] [2023-12-22 02:39:00,817 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 (9)] Forceful destruction successful, exit code 0 [2023-12-22 02:39:01,015 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:39:01,016 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:01,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:01,016 INFO L85 PathProgramCache]: Analyzing trace with hash -698017479, now seen corresponding path program 1 times [2023-12-22 02:39:01,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:01,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306428825] [2023-12-22 02:39:01,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:01,017 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:39:01,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:01,018 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:39:01,018 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:39:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:01,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-22 02:39:01,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:01,093 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:39:01,093 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:01,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:01,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306428825] [2023-12-22 02:39:01,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306428825] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:01,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:01,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 02:39:01,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411219337] [2023-12-22 02:39:01,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:01,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:39:01,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:01,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:39:01,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:39:01,095 INFO L87 Difference]: Start difference. First operand 919 states and 1210 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:39:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:01,465 INFO L93 Difference]: Finished difference Result 1330 states and 1825 transitions. [2023-12-22 02:39:01,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:39:01,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2023-12-22 02:39:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:01,470 INFO L225 Difference]: With dead ends: 1330 [2023-12-22 02:39:01,470 INFO L226 Difference]: Without dead ends: 1140 [2023-12-22 02:39:01,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:39:01,473 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 262 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:01,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 574 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:39:01,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2023-12-22 02:39:01,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1132. [2023-12-22 02:39:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 889 states have (on average 1.3554555680539933) internal successors, (1205), 911 states have internal predecessors, (1205), 143 states have call successors, (143), 85 states have call predecessors, (143), 98 states have return successors, (170), 140 states have call predecessors, (170), 141 states have call successors, (170) [2023-12-22 02:39:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1518 transitions. [2023-12-22 02:39:01,532 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1518 transitions. Word has length 57 [2023-12-22 02:39:01,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:01,532 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 1518 transitions. [2023-12-22 02:39:01,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:39:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1518 transitions. [2023-12-22 02:39:01,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-22 02:39:01,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:01,533 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] [2023-12-22 02:39:01,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-22 02:39:01,739 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:39:01,739 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:01,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:01,740 INFO L85 PathProgramCache]: Analyzing trace with hash -622179591, now seen corresponding path program 1 times [2023-12-22 02:39:01,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:01,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014855747] [2023-12-22 02:39:01,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:01,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:39:01,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:01,741 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:39:01,745 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:39:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:01,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:39:01,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:01,814 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:39:01,814 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:01,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:01,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014855747] [2023-12-22 02:39:01,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014855747] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:01,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:01,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:39:01,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524877331] [2023-12-22 02:39:01,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:01,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:39:01,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:01,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:39:01,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:01,815 INFO L87 Difference]: Start difference. First operand 1132 states and 1518 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:39:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:01,929 INFO L93 Difference]: Finished difference Result 1878 states and 2585 transitions. [2023-12-22 02:39:01,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:01,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2023-12-22 02:39:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:01,934 INFO L225 Difference]: With dead ends: 1878 [2023-12-22 02:39:01,934 INFO L226 Difference]: Without dead ends: 1489 [2023-12-22 02:39:01,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:01,935 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 241 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:01,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 391 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:01,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2023-12-22 02:39:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1481. [2023-12-22 02:39:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1160 states have (on average 1.3663793103448276) internal successors, (1585), 1192 states have internal predecessors, (1585), 183 states have call successors, (183), 113 states have call predecessors, (183), 136 states have return successors, (227), 180 states have call predecessors, (227), 181 states have call successors, (227) [2023-12-22 02:39:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 1995 transitions. [2023-12-22 02:39:02,013 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 1995 transitions. Word has length 57 [2023-12-22 02:39:02,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:02,013 INFO L495 AbstractCegarLoop]: Abstraction has 1481 states and 1995 transitions. [2023-12-22 02:39:02,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:39:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1995 transitions. [2023-12-22 02:39:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-22 02:39:02,015 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:02,015 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] [2023-12-22 02:39:02,018 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:39:02,218 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:39:02,218 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:02,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:02,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1878730546, now seen corresponding path program 1 times [2023-12-22 02:39:02,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:02,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368857231] [2023-12-22 02:39:02,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:02,219 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:39:02,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:02,220 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:39:02,240 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:39:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:02,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:39:02,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:02,298 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:39:02,299 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:02,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:02,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368857231] [2023-12-22 02:39:02,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368857231] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:02,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:02,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 02:39:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275366866] [2023-12-22 02:39:02,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:02,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:39:02,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:02,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:39:02,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:39:02,300 INFO L87 Difference]: Start difference. First operand 1481 states and 1995 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:39:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:02,434 INFO L93 Difference]: Finished difference Result 2255 states and 3099 transitions. [2023-12-22 02:39:02,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:39:02,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-12-22 02:39:02,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:02,440 INFO L225 Difference]: With dead ends: 2255 [2023-12-22 02:39:02,440 INFO L226 Difference]: Without dead ends: 1517 [2023-12-22 02:39:02,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:39:02,442 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 6 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:02,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1264 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:39:02,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2023-12-22 02:39:02,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1497. [2023-12-22 02:39:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1172 states have (on average 1.3592150170648465) internal successors, (1593), 1204 states have internal predecessors, (1593), 183 states have call successors, (183), 113 states have call predecessors, (183), 140 states have return successors, (231), 184 states have call predecessors, (231), 181 states have call successors, (231) [2023-12-22 02:39:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2007 transitions. [2023-12-22 02:39:02,513 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2007 transitions. Word has length 58 [2023-12-22 02:39:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:02,513 INFO L495 AbstractCegarLoop]: Abstraction has 1497 states and 2007 transitions. [2023-12-22 02:39:02,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:39:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2007 transitions. [2023-12-22 02:39:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-22 02:39:02,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:02,514 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] [2023-12-22 02:39:02,520 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:39:02,718 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:39:02,718 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:02,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:02,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1806343988, now seen corresponding path program 1 times [2023-12-22 02:39:02,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:02,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236703813] [2023-12-22 02:39:02,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:02,719 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:39:02,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:02,720 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:39:02,749 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:39:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:02,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:39:02,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:02,803 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:39:02,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:02,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:02,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236703813] [2023-12-22 02:39:02,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236703813] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:02,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:02,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:39:02,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040096737] [2023-12-22 02:39:02,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:02,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:39:02,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:02,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:39:02,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:02,805 INFO L87 Difference]: Start difference. First operand 1497 states and 2007 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:39:02,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:02,965 INFO L93 Difference]: Finished difference Result 2949 states and 4023 transitions. [2023-12-22 02:39:02,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:02,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-12-22 02:39:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:02,976 INFO L225 Difference]: With dead ends: 2949 [2023-12-22 02:39:02,976 INFO L226 Difference]: Without dead ends: 2195 [2023-12-22 02:39:02,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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:39:02,980 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 230 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:02,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 367 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:02,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2023-12-22 02:39:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 2187. [2023-12-22 02:39:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2187 states, 1702 states have (on average 1.3554641598119859) internal successors, (2307), 1754 states have internal predecessors, (2307), 263 states have call successors, (263), 169 states have call predecessors, (263), 220 states have return successors, (349), 268 states have call predecessors, (349), 261 states have call successors, (349) [2023-12-22 02:39:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 2919 transitions. [2023-12-22 02:39:03,126 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 2919 transitions. Word has length 58 [2023-12-22 02:39:03,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:03,127 INFO L495 AbstractCegarLoop]: Abstraction has 2187 states and 2919 transitions. [2023-12-22 02:39:03,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:39:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 2919 transitions. [2023-12-22 02:39:03,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-22 02:39:03,129 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:03,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:39:03,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-22 02:39:03,333 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:39:03,333 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:03,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:03,333 INFO L85 PathProgramCache]: Analyzing trace with hash -675795276, now seen corresponding path program 1 times [2023-12-22 02:39:03,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:03,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877621604] [2023-12-22 02:39:03,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:03,334 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:39:03,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:03,335 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:39:03,339 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:39:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:03,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:39:03,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:03,409 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:39:03,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:03,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:03,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877621604] [2023-12-22 02:39:03,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877621604] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:03,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:03,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 02:39:03,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439845020] [2023-12-22 02:39:03,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:03,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:39:03,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:03,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:39:03,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:39:03,411 INFO L87 Difference]: Start difference. First operand 2187 states and 2919 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:39:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:03,564 INFO L93 Difference]: Finished difference Result 3679 states and 4975 transitions. [2023-12-22 02:39:03,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:39:03,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2023-12-22 02:39:03,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:03,572 INFO L225 Difference]: With dead ends: 3679 [2023-12-22 02:39:03,573 INFO L226 Difference]: Without dead ends: 2235 [2023-12-22 02:39:03,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:39:03,576 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 3 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:03,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1259 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:39:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2023-12-22 02:39:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 2219. [2023-12-22 02:39:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2219 states, 1726 states have (on average 1.3458864426419468) internal successors, (2323), 1778 states have internal predecessors, (2323), 263 states have call successors, (263), 169 states have call predecessors, (263), 228 states have return successors, (357), 276 states have call predecessors, (357), 261 states have call successors, (357) [2023-12-22 02:39:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 2943 transitions. [2023-12-22 02:39:03,731 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 2943 transitions. Word has length 73 [2023-12-22 02:39:03,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:03,731 INFO L495 AbstractCegarLoop]: Abstraction has 2219 states and 2943 transitions. [2023-12-22 02:39:03,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:39:03,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2943 transitions. [2023-12-22 02:39:03,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-22 02:39:03,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:03,733 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:39:03,739 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:39:03,937 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:39:03,937 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:03,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:03,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1773804854, now seen corresponding path program 1 times [2023-12-22 02:39:03,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:03,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489650192] [2023-12-22 02:39:03,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:03,938 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:39:03,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:03,939 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:39:03,968 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:39:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:03,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:39:03,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-22 02:39:04,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:04,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:04,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489650192] [2023-12-22 02:39:04,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489650192] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:04,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:04,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:39:04,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788087513] [2023-12-22 02:39:04,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:04,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:39:04,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:04,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:39:04,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:39:04,047 INFO L87 Difference]: Start difference. First operand 2219 states and 2943 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-22 02:39:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:04,456 INFO L93 Difference]: Finished difference Result 5135 states and 6926 transitions. [2023-12-22 02:39:04,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:39:04,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 73 [2023-12-22 02:39:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:04,472 INFO L225 Difference]: With dead ends: 5135 [2023-12-22 02:39:04,472 INFO L226 Difference]: Without dead ends: 3663 [2023-12-22 02:39:04,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 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:39:04,477 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 342 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:04,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 319 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:39:04,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3663 states. [2023-12-22 02:39:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3663 to 3659. [2023-12-22 02:39:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3659 states, 2810 states have (on average 1.3306049822064057) internal successors, (3739), 2910 states have internal predecessors, (3739), 443 states have call successors, (443), 281 states have call predecessors, (443), 404 states have return successors, (694), 476 states have call predecessors, (694), 441 states have call successors, (694) [2023-12-22 02:39:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 4876 transitions. [2023-12-22 02:39:04,750 INFO L78 Accepts]: Start accepts. Automaton has 3659 states and 4876 transitions. Word has length 73 [2023-12-22 02:39:04,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:04,751 INFO L495 AbstractCegarLoop]: Abstraction has 3659 states and 4876 transitions. [2023-12-22 02:39:04,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-22 02:39:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3659 states and 4876 transitions. [2023-12-22 02:39:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-22 02:39:04,755 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:04,756 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:39:04,759 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:39:04,960 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:39:04,960 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:04,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:04,960 INFO L85 PathProgramCache]: Analyzing trace with hash -997725148, now seen corresponding path program 1 times [2023-12-22 02:39:04,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:04,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480497175] [2023-12-22 02:39:04,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:04,961 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:39:04,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:04,962 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:39:04,993 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:39:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:05,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:39:05,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:05,041 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:39:05,041 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:05,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:05,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480497175] [2023-12-22 02:39:05,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480497175] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:05,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:05,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:39:05,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306366224] [2023-12-22 02:39:05,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:05,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:39:05,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:05,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:39:05,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:05,043 INFO L87 Difference]: Start difference. First operand 3659 states and 4876 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:39:05,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:05,417 INFO L93 Difference]: Finished difference Result 9327 states and 12505 transitions. [2023-12-22 02:39:05,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:05,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2023-12-22 02:39:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:05,438 INFO L225 Difference]: With dead ends: 9327 [2023-12-22 02:39:05,438 INFO L226 Difference]: Without dead ends: 5083 [2023-12-22 02:39:05,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 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:39:05,448 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 110 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 605 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:39:05,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 605 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:05,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5083 states. [2023-12-22 02:39:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5083 to 5083. [2023-12-22 02:39:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5083 states, 3890 states have (on average 1.3241645244215938) internal successors, (5151), 4030 states have internal predecessors, (5151), 607 states have call successors, (607), 393 states have call predecessors, (607), 584 states have return successors, (1026), 668 states have call predecessors, (1026), 605 states have call successors, (1026) [2023-12-22 02:39:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5083 states to 5083 states and 6784 transitions. [2023-12-22 02:39:05,855 INFO L78 Accepts]: Start accepts. Automaton has 5083 states and 6784 transitions. Word has length 75 [2023-12-22 02:39:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:05,855 INFO L495 AbstractCegarLoop]: Abstraction has 5083 states and 6784 transitions. [2023-12-22 02:39:05,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:39:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 5083 states and 6784 transitions. [2023-12-22 02:39:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-22 02:39:05,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:05,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:05,867 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:39:06,064 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:39:06,065 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:06,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:06,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1119926315, now seen corresponding path program 1 times [2023-12-22 02:39:06,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:06,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108768095] [2023-12-22 02:39:06,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:06,066 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:39:06,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:06,067 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:39:06,068 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:39:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:06,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-22 02:39:06,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 02:39:06,217 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:06,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:06,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108768095] [2023-12-22 02:39:06,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108768095] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:06,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:06,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:39:06,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559618005] [2023-12-22 02:39:06,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:06,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:39:06,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:06,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:39:06,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:39:06,219 INFO L87 Difference]: Start difference. First operand 5083 states and 6784 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:39:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:06,848 INFO L93 Difference]: Finished difference Result 6425 states and 8535 transitions. [2023-12-22 02:39:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:39:06,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 83 [2023-12-22 02:39:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:06,877 INFO L225 Difference]: With dead ends: 6425 [2023-12-22 02:39:06,877 INFO L226 Difference]: Without dead ends: 5717 [2023-12-22 02:39:06,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 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:39:06,882 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 308 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:06,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 358 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:39:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5717 states. [2023-12-22 02:39:07,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5717 to 5691. [2023-12-22 02:39:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5691 states, 4359 states have (on average 1.3158981417756366) internal successors, (5736), 4512 states have internal predecessors, (5736), 686 states have call successors, (686), 441 states have call predecessors, (686), 644 states have return successors, (1147), 747 states have call predecessors, (1147), 684 states have call successors, (1147) [2023-12-22 02:39:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5691 states to 5691 states and 7569 transitions. [2023-12-22 02:39:07,233 INFO L78 Accepts]: Start accepts. Automaton has 5691 states and 7569 transitions. Word has length 83 [2023-12-22 02:39:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:07,233 INFO L495 AbstractCegarLoop]: Abstraction has 5691 states and 7569 transitions. [2023-12-22 02:39:07,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:39:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 5691 states and 7569 transitions. [2023-12-22 02:39:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-22 02:39:07,238 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:07,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:07,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-22 02:39:07,441 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:39:07,441 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:07,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1097704083, now seen corresponding path program 1 times [2023-12-22 02:39:07,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:07,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419980302] [2023-12-22 02:39:07,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:07,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:39:07,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:07,444 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:39:07,448 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:39:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:07,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:39:07,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-22 02:39:07,516 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:07,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:07,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419980302] [2023-12-22 02:39:07,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419980302] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:07,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:07,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:39:07,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106121441] [2023-12-22 02:39:07,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:07,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:39:07,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:07,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:39:07,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:07,517 INFO L87 Difference]: Start difference. First operand 5691 states and 7569 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:39:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:07,812 INFO L93 Difference]: Finished difference Result 6717 states and 8876 transitions. [2023-12-22 02:39:07,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:07,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 83 [2023-12-22 02:39:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:07,837 INFO L225 Difference]: With dead ends: 6717 [2023-12-22 02:39:07,838 INFO L226 Difference]: Without dead ends: 5401 [2023-12-22 02:39:07,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 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:39:07,843 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 122 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:07,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 387 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5401 states. [2023-12-22 02:39:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5401 to 5401. [2023-12-22 02:39:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 4136 states have (on average 1.3181818181818181) internal successors, (5452), 4284 states have internal predecessors, (5452), 645 states have call successors, (645), 417 states have call predecessors, (645), 618 states have return successors, (1092), 708 states have call predecessors, (1092), 643 states have call successors, (1092) [2023-12-22 02:39:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 7189 transitions. [2023-12-22 02:39:08,209 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 7189 transitions. Word has length 83 [2023-12-22 02:39:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:08,209 INFO L495 AbstractCegarLoop]: Abstraction has 5401 states and 7189 transitions. [2023-12-22 02:39:08,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:39:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 7189 transitions. [2023-12-22 02:39:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-22 02:39:08,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:08,215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:08,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 (18)] Forceful destruction successful, exit code 0 [2023-12-22 02:39:08,418 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:39:08,419 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:08,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:08,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1520286544, now seen corresponding path program 1 times [2023-12-22 02:39:08,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:08,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096087110] [2023-12-22 02:39:08,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:08,420 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:39:08,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:08,421 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:39:08,425 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:39:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:08,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:39:08,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 02:39:08,499 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:08,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:08,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096087110] [2023-12-22 02:39:08,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096087110] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:08,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:08,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:39:08,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496150967] [2023-12-22 02:39:08,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:08,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:39:08,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:08,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:39:08,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:08,501 INFO L87 Difference]: Start difference. First operand 5401 states and 7189 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:39:08,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:08,958 INFO L93 Difference]: Finished difference Result 7184 states and 9493 transitions. [2023-12-22 02:39:08,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:08,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 85 [2023-12-22 02:39:08,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:08,975 INFO L225 Difference]: With dead ends: 7184 [2023-12-22 02:39:08,975 INFO L226 Difference]: Without dead ends: 5711 [2023-12-22 02:39:08,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 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:39:08,982 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 94 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 561 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:39:08,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 561 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:08,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2023-12-22 02:39:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 5711. [2023-12-22 02:39:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5711 states, 4390 states have (on average 1.312756264236902) internal successors, (5763), 4540 states have internal predecessors, (5763), 675 states have call successors, (675), 439 states have call predecessors, (675), 644 states have return successors, (1137), 740 states have call predecessors, (1137), 673 states have call successors, (1137) [2023-12-22 02:39:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5711 states to 5711 states and 7575 transitions. [2023-12-22 02:39:09,373 INFO L78 Accepts]: Start accepts. Automaton has 5711 states and 7575 transitions. Word has length 85 [2023-12-22 02:39:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:09,373 INFO L495 AbstractCegarLoop]: Abstraction has 5711 states and 7575 transitions. [2023-12-22 02:39:09,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:39:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 5711 states and 7575 transitions. [2023-12-22 02:39:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-22 02:39:09,384 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:09,385 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] [2023-12-22 02:39:09,390 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:39:09,588 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:39:09,588 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:09,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:09,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1639136956, now seen corresponding path program 1 times [2023-12-22 02:39:09,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:09,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502222780] [2023-12-22 02:39:09,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:09,589 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:39:09,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:09,591 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:39:09,619 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:39:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:09,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:39:09,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-22 02:39:09,706 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:09,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:09,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502222780] [2023-12-22 02:39:09,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502222780] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:09,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:09,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:39:09,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363810497] [2023-12-22 02:39:09,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:09,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:39:09,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:09,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:39:09,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:39:09,708 INFO L87 Difference]: Start difference. First operand 5711 states and 7575 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:39:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:10,272 INFO L93 Difference]: Finished difference Result 7217 states and 9481 transitions. [2023-12-22 02:39:10,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:39:10,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 121 [2023-12-22 02:39:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:10,288 INFO L225 Difference]: With dead ends: 7217 [2023-12-22 02:39:10,288 INFO L226 Difference]: Without dead ends: 5881 [2023-12-22 02:39:10,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 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:39:10,291 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 314 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:10,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 335 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:39:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5881 states. [2023-12-22 02:39:10,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5881 to 5881. [2023-12-22 02:39:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5881 states, 4542 states have (on average 1.3044914134742405) internal successors, (5925), 4698 states have internal predecessors, (5925), 675 states have call successors, (675), 449 states have call predecessors, (675), 662 states have return successors, (1125), 742 states have call predecessors, (1125), 673 states have call successors, (1125) [2023-12-22 02:39:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5881 states to 5881 states and 7725 transitions. [2023-12-22 02:39:10,613 INFO L78 Accepts]: Start accepts. Automaton has 5881 states and 7725 transitions. Word has length 121 [2023-12-22 02:39:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:10,613 INFO L495 AbstractCegarLoop]: Abstraction has 5881 states and 7725 transitions. [2023-12-22 02:39:10,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:39:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5881 states and 7725 transitions. [2023-12-22 02:39:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-22 02:39:10,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:10,628 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:39:10,634 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:39:10,832 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:39:10,832 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:10,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:10,833 INFO L85 PathProgramCache]: Analyzing trace with hash -638015693, now seen corresponding path program 1 times [2023-12-22 02:39:10,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:10,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031985365] [2023-12-22 02:39:10,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:10,833 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:39:10,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:10,835 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:39:10,864 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:39:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:10,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:39:10,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 02:39:10,925 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:10,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:10,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031985365] [2023-12-22 02:39:10,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031985365] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:10,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:10,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:39:10,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336424399] [2023-12-22 02:39:10,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:10,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:39:10,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:10,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:39:10,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:10,926 INFO L87 Difference]: Start difference. First operand 5881 states and 7725 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:39:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:11,272 INFO L93 Difference]: Finished difference Result 7087 states and 9218 transitions. [2023-12-22 02:39:11,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 122 [2023-12-22 02:39:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:11,286 INFO L225 Difference]: With dead ends: 7087 [2023-12-22 02:39:11,286 INFO L226 Difference]: Without dead ends: 5883 [2023-12-22 02:39:11,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 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:39:11,290 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 88 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:11,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 575 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2023-12-22 02:39:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 5881. [2023-12-22 02:39:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5881 states, 4542 states have (on average 1.3027300748568913) internal successors, (5917), 4698 states have internal predecessors, (5917), 675 states have call successors, (675), 449 states have call predecessors, (675), 662 states have return successors, (1119), 742 states have call predecessors, (1119), 673 states have call successors, (1119) [2023-12-22 02:39:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5881 states to 5881 states and 7711 transitions. [2023-12-22 02:39:11,610 INFO L78 Accepts]: Start accepts. Automaton has 5881 states and 7711 transitions. Word has length 122 [2023-12-22 02:39:11,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:11,611 INFO L495 AbstractCegarLoop]: Abstraction has 5881 states and 7711 transitions. [2023-12-22 02:39:11,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:39:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 5881 states and 7711 transitions. [2023-12-22 02:39:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-22 02:39:11,621 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:11,621 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:39:11,639 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:39:11,825 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:39:11,826 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:11,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:11,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1116087755, now seen corresponding path program 1 times [2023-12-22 02:39:11,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:11,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163446836] [2023-12-22 02:39:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:11,827 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:39:11,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:11,828 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:39:11,835 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:39:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:11,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:39:11,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-22 02:39:11,908 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:11,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:11,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163446836] [2023-12-22 02:39:11,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163446836] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:11,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:11,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:39:11,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233603563] [2023-12-22 02:39:11,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:11,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:39:11,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:11,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:39:11,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:11,910 INFO L87 Difference]: Start difference. First operand 5881 states and 7711 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-22 02:39:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:12,310 INFO L93 Difference]: Finished difference Result 6901 states and 8993 transitions. [2023-12-22 02:39:12,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:12,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 123 [2023-12-22 02:39:12,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:12,323 INFO L225 Difference]: With dead ends: 6901 [2023-12-22 02:39:12,323 INFO L226 Difference]: Without dead ends: 5027 [2023-12-22 02:39:12,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 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:39:12,328 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 248 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:12,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 268 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:12,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2023-12-22 02:39:12,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 5027. [2023-12-22 02:39:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5027 states, 3850 states have (on average 1.3005194805194804) internal successors, (5007), 3988 states have internal predecessors, (5007), 595 states have call successors, (595), 389 states have call predecessors, (595), 580 states have return successors, (1014), 658 states have call predecessors, (1014), 593 states have call successors, (1014) [2023-12-22 02:39:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6616 transitions. [2023-12-22 02:39:12,789 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6616 transitions. Word has length 123 [2023-12-22 02:39:12,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:12,790 INFO L495 AbstractCegarLoop]: Abstraction has 5027 states and 6616 transitions. [2023-12-22 02:39:12,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-22 02:39:12,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6616 transitions. [2023-12-22 02:39:12,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-22 02:39:12,800 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:12,800 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:39:12,806 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:39:13,004 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:39:13,004 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:13,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:13,004 INFO L85 PathProgramCache]: Analyzing trace with hash -50566100, now seen corresponding path program 2 times [2023-12-22 02:39:13,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:13,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865051124] [2023-12-22 02:39:13,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 02:39:13,005 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:39:13,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:13,006 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:39:13,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-22 02:39:13,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-22 02:39:13,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 02:39:13,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:39:13,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-22 02:39:13,112 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:13,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:13,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865051124] [2023-12-22 02:39:13,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865051124] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:13,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:13,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:39:13,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279300819] [2023-12-22 02:39:13,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:13,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:39:13,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:13,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:39:13,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:13,113 INFO L87 Difference]: Start difference. First operand 5027 states and 6616 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-22 02:39:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:13,403 INFO L93 Difference]: Finished difference Result 5543 states and 7212 transitions. [2023-12-22 02:39:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:13,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 123 [2023-12-22 02:39:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:13,421 INFO L225 Difference]: With dead ends: 5543 [2023-12-22 02:39:13,422 INFO L226 Difference]: Without dead ends: 5027 [2023-12-22 02:39:13,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 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:39:13,427 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 83 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:13,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 494 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2023-12-22 02:39:13,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 5027. [2023-12-22 02:39:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5027 states, 3850 states have (on average 1.2984415584415585) internal successors, (4999), 3988 states have internal predecessors, (4999), 595 states have call successors, (595), 389 states have call predecessors, (595), 580 states have return successors, (1014), 658 states have call predecessors, (1014), 593 states have call successors, (1014) [2023-12-22 02:39:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6608 transitions. [2023-12-22 02:39:13,757 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6608 transitions. Word has length 123 [2023-12-22 02:39:13,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:13,758 INFO L495 AbstractCegarLoop]: Abstraction has 5027 states and 6608 transitions. [2023-12-22 02:39:13,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-22 02:39:13,758 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6608 transitions. [2023-12-22 02:39:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-22 02:39:13,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:13,769 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:39:13,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-22 02:39:13,973 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:39:13,973 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:13,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:13,974 INFO L85 PathProgramCache]: Analyzing trace with hash 865400034, now seen corresponding path program 1 times [2023-12-22 02:39:13,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:13,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089784219] [2023-12-22 02:39:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:13,974 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:39:13,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:13,976 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:39:14,002 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:39:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:14,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 02:39:14,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 50 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-22 02:39:14,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:39:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-22 02:39:14,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:14,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089784219] [2023-12-22 02:39:14,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089784219] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 02:39:14,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 02:39:14,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-12-22 02:39:14,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690875671] [2023-12-22 02:39:14,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:14,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:39:14,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:14,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:39:14,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:39:14,229 INFO L87 Difference]: Start difference. First operand 5027 states and 6608 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-22 02:39:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:14,664 INFO L93 Difference]: Finished difference Result 5029 states and 6610 transitions. [2023-12-22 02:39:14,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:39:14,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 124 [2023-12-22 02:39:14,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:14,679 INFO L225 Difference]: With dead ends: 5029 [2023-12-22 02:39:14,679 INFO L226 Difference]: Without dead ends: 4367 [2023-12-22 02:39:14,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 244 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:39:14,683 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 324 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:14,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 558 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:39:14,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4367 states. [2023-12-22 02:39:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4367 to 4367. [2023-12-22 02:39:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4367 states, 3323 states have (on average 1.3286187180258802) internal successors, (4415), 3453 states have internal predecessors, (4415), 519 states have call successors, (519), 337 states have call predecessors, (519), 524 states have return successors, (934), 584 states have call predecessors, (934), 517 states have call successors, (934) [2023-12-22 02:39:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4367 states to 4367 states and 5868 transitions. [2023-12-22 02:39:14,966 INFO L78 Accepts]: Start accepts. Automaton has 4367 states and 5868 transitions. Word has length 124 [2023-12-22 02:39:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:14,966 INFO L495 AbstractCegarLoop]: Abstraction has 4367 states and 5868 transitions. [2023-12-22 02:39:14,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-22 02:39:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4367 states and 5868 transitions. [2023-12-22 02:39:14,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-22 02:39:14,975 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:14,976 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:39:14,982 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:39:15,179 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:39:15,180 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:15,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:15,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1324955511, now seen corresponding path program 1 times [2023-12-22 02:39:15,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:15,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243618301] [2023-12-22 02:39:15,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:15,181 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:39:15,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:15,182 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:39:15,208 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:39:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:15,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:39:15,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-22 02:39:15,282 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:15,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:15,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243618301] [2023-12-22 02:39:15,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243618301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:15,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:15,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 02:39:15,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280579621] [2023-12-22 02:39:15,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:15,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:39:15,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:15,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:39:15,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:39:15,283 INFO L87 Difference]: Start difference. First operand 4367 states and 5868 transitions. Second operand has 6 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-22 02:39:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:15,587 INFO L93 Difference]: Finished difference Result 8723 states and 11822 transitions. [2023-12-22 02:39:15,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 02:39:15,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2023-12-22 02:39:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:15,599 INFO L225 Difference]: With dead ends: 8723 [2023-12-22 02:39:15,599 INFO L226 Difference]: Without dead ends: 4407 [2023-12-22 02:39:15,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-22 02:39:15,609 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 32 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:15,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 671 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4407 states. [2023-12-22 02:39:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4407 to 3921. [2023-12-22 02:39:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3045 states have (on average 1.3146141215106733) internal successors, (4003), 3114 states have internal predecessors, (4003), 423 states have call successors, (423), 286 states have call predecessors, (423), 452 states have return successors, (791), 528 states have call predecessors, (791), 421 states have call successors, (791) [2023-12-22 02:39:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 5217 transitions. [2023-12-22 02:39:15,858 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 5217 transitions. Word has length 138 [2023-12-22 02:39:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:15,859 INFO L495 AbstractCegarLoop]: Abstraction has 3921 states and 5217 transitions. [2023-12-22 02:39:15,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-22 02:39:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 5217 transitions. [2023-12-22 02:39:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-22 02:39:15,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:15,868 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-22 02:39:15,873 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 (25)] Ended with exit code 0 [2023-12-22 02:39:16,069 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:39:16,069 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:16,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:16,070 INFO L85 PathProgramCache]: Analyzing trace with hash 463726555, now seen corresponding path program 1 times [2023-12-22 02:39:16,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:16,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502213701] [2023-12-22 02:39:16,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:16,070 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:39:16,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:16,071 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:39:16,076 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:39:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:16,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:39:16,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-12-22 02:39:16,162 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:16,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:16,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502213701] [2023-12-22 02:39:16,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502213701] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:16,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:16,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:39:16,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805947702] [2023-12-22 02:39:16,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:16,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:39:16,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:16,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:39:16,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:16,164 INFO L87 Difference]: Start difference. First operand 3921 states and 5217 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-22 02:39:16,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:16,316 INFO L93 Difference]: Finished difference Result 6228 states and 8280 transitions. [2023-12-22 02:39:16,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:16,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 139 [2023-12-22 02:39:16,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:16,322 INFO L225 Difference]: With dead ends: 6228 [2023-12-22 02:39:16,322 INFO L226 Difference]: Without dead ends: 2398 [2023-12-22 02:39:16,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 137 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:39:16,329 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 138 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:16,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 133 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2023-12-22 02:39:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2398. [2023-12-22 02:39:16,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 1864 states have (on average 1.3159871244635193) internal successors, (2453), 1907 states have internal predecessors, (2453), 247 states have call successors, (247), 174 states have call predecessors, (247), 286 states have return successors, (471), 316 states have call predecessors, (471), 245 states have call successors, (471) [2023-12-22 02:39:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3171 transitions. [2023-12-22 02:39:16,532 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3171 transitions. Word has length 139 [2023-12-22 02:39:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:16,532 INFO L495 AbstractCegarLoop]: Abstraction has 2398 states and 3171 transitions. [2023-12-22 02:39:16,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-22 02:39:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3171 transitions. [2023-12-22 02:39:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-22 02:39:16,536 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:16,536 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:39:16,542 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:39:16,740 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:39:16,740 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:16,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:16,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1509023273, now seen corresponding path program 1 times [2023-12-22 02:39:16,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:16,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061033871] [2023-12-22 02:39:16,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:16,741 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:39:16,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:16,742 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:39:16,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-22 02:39:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:16,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:39:16,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-22 02:39:16,902 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:16,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:16,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061033871] [2023-12-22 02:39:16,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061033871] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:16,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:16,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:39:16,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290230326] [2023-12-22 02:39:16,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:16,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:39:16,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:16,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:39:16,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:16,903 INFO L87 Difference]: Start difference. First operand 2398 states and 3171 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-22 02:39:17,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:17,139 INFO L93 Difference]: Finished difference Result 6098 states and 8232 transitions. [2023-12-22 02:39:17,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:17,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2023-12-22 02:39:17,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:17,149 INFO L225 Difference]: With dead ends: 6098 [2023-12-22 02:39:17,149 INFO L226 Difference]: Without dead ends: 3991 [2023-12-22 02:39:17,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 139 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:39:17,154 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 64 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:17,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 266 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3991 states. [2023-12-22 02:39:17,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3991 to 3963. [2023-12-22 02:39:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3963 states, 3091 states have (on average 1.3235198964736332) internal successors, (4091), 3170 states have internal predecessors, (4091), 403 states have call successors, (403), 282 states have call predecessors, (403), 468 states have return successors, (780), 510 states have call predecessors, (780), 401 states have call successors, (780) [2023-12-22 02:39:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 3963 states and 5274 transitions. [2023-12-22 02:39:17,405 INFO L78 Accepts]: Start accepts. Automaton has 3963 states and 5274 transitions. Word has length 141 [2023-12-22 02:39:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:17,405 INFO L495 AbstractCegarLoop]: Abstraction has 3963 states and 5274 transitions. [2023-12-22 02:39:17,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-22 02:39:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 5274 transitions. [2023-12-22 02:39:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-22 02:39:17,409 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:17,409 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:39:17,414 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:39:17,613 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:39:17,614 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:17,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:17,614 INFO L85 PathProgramCache]: Analyzing trace with hash 231582694, now seen corresponding path program 1 times [2023-12-22 02:39:17,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:17,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729937423] [2023-12-22 02:39:17,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:17,615 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:39:17,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:17,616 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:39:17,618 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:39:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:17,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:39:17,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 02:39:17,732 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:17,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:17,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729937423] [2023-12-22 02:39:17,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729937423] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:17,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:17,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:39:17,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62407011] [2023-12-22 02:39:17,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:17,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:39:17,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:17,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:39:17,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:17,733 INFO L87 Difference]: Start difference. First operand 3963 states and 5274 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-22 02:39:18,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:18,223 INFO L93 Difference]: Finished difference Result 10879 states and 15015 transitions. [2023-12-22 02:39:18,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:18,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 142 [2023-12-22 02:39:18,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:18,245 INFO L225 Difference]: With dead ends: 10879 [2023-12-22 02:39:18,245 INFO L226 Difference]: Without dead ends: 7207 [2023-12-22 02:39:18,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 140 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:39:18,255 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 94 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 301 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.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:18,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 301 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:18,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7207 states. [2023-12-22 02:39:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7207 to 7155. [2023-12-22 02:39:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7155 states, 5583 states have (on average 1.3055704818198102) internal successors, (7289), 5712 states have internal predecessors, (7289), 739 states have call successors, (739), 516 states have call predecessors, (739), 832 states have return successors, (1578), 926 states have call predecessors, (1578), 737 states have call successors, (1578) [2023-12-22 02:39:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7155 states to 7155 states and 9606 transitions. [2023-12-22 02:39:18,729 INFO L78 Accepts]: Start accepts. Automaton has 7155 states and 9606 transitions. Word has length 142 [2023-12-22 02:39:18,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:18,730 INFO L495 AbstractCegarLoop]: Abstraction has 7155 states and 9606 transitions. [2023-12-22 02:39:18,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-22 02:39:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 7155 states and 9606 transitions. [2023-12-22 02:39:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-22 02:39:18,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:18,739 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-22 02:39:18,742 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 (28)] Ended with exit code 0 [2023-12-22 02:39:18,941 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:39:18,941 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:18,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:18,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1671845949, now seen corresponding path program 1 times [2023-12-22 02:39:18,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:18,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363521479] [2023-12-22 02:39:18,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:18,942 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:39:18,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:18,943 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:39:18,944 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:39:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:19,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:39:19,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-22 02:39:19,116 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:19,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:19,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363521479] [2023-12-22 02:39:19,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363521479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:19,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:19,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:39:19,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668886087] [2023-12-22 02:39:19,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:19,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:39:19,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:19,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:39:19,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:19,118 INFO L87 Difference]: Start difference. First operand 7155 states and 9606 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-22 02:39:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:20,014 INFO L93 Difference]: Finished difference Result 20767 states and 28263 transitions. [2023-12-22 02:39:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:20,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2023-12-22 02:39:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:20,044 INFO L225 Difference]: With dead ends: 20767 [2023-12-22 02:39:20,045 INFO L226 Difference]: Without dead ends: 13903 [2023-12-22 02:39:20,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 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:39:20,058 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 68 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:20,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 254 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13903 states. [2023-12-22 02:39:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13903 to 13899. [2023-12-22 02:39:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13899 states, 10850 states have (on average 1.2952073732718894) internal successors, (14053), 11108 states have internal predecessors, (14053), 1447 states have call successors, (1447), 1002 states have call predecessors, (1447), 1601 states have return successors, (3052), 1788 states have call predecessors, (3052), 1445 states have call successors, (3052) [2023-12-22 02:39:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13899 states to 13899 states and 18552 transitions. [2023-12-22 02:39:21,028 INFO L78 Accepts]: Start accepts. Automaton has 13899 states and 18552 transitions. Word has length 143 [2023-12-22 02:39:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:21,028 INFO L495 AbstractCegarLoop]: Abstraction has 13899 states and 18552 transitions. [2023-12-22 02:39:21,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-22 02:39:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 13899 states and 18552 transitions. [2023-12-22 02:39:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-22 02:39:21,040 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:21,040 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:39:21,044 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 (29)] Ended with exit code 0 [2023-12-22 02:39:21,240 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:39:21,241 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:21,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:21,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1005886228, now seen corresponding path program 1 times [2023-12-22 02:39:21,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:21,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262046827] [2023-12-22 02:39:21,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:21,241 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:39:21,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:21,242 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:39:21,243 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:39:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:21,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:39:21,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-22 02:39:21,335 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:21,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:21,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262046827] [2023-12-22 02:39:21,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262046827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:21,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:21,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:39:21,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663493182] [2023-12-22 02:39:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:21,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:39:21,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:21,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:39:21,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:39:21,336 INFO L87 Difference]: Start difference. First operand 13899 states and 18552 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-22 02:39:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:23,307 INFO L93 Difference]: Finished difference Result 40546 states and 54300 transitions. [2023-12-22 02:39:23,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 02:39:23,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 147 [2023-12-22 02:39:23,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:23,384 INFO L225 Difference]: With dead ends: 40546 [2023-12-22 02:39:23,384 INFO L226 Difference]: Without dead ends: 26651 [2023-12-22 02:39:23,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-22 02:39:23,412 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 219 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:23,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 245 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:39:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26651 states. [2023-12-22 02:39:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26651 to 26603. [2023-12-22 02:39:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26603 states, 20648 states have (on average 1.2851607903913211) internal successors, (26536), 21129 states have internal predecessors, (26536), 2842 states have call successors, (2842), 1953 states have call predecessors, (2842), 3112 states have return successors, (5846), 3520 states have call predecessors, (5846), 2840 states have call successors, (5846) [2023-12-22 02:39:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26603 states to 26603 states and 35224 transitions. [2023-12-22 02:39:25,636 INFO L78 Accepts]: Start accepts. Automaton has 26603 states and 35224 transitions. Word has length 147 [2023-12-22 02:39:25,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:25,636 INFO L495 AbstractCegarLoop]: Abstraction has 26603 states and 35224 transitions. [2023-12-22 02:39:25,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-22 02:39:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 26603 states and 35224 transitions. [2023-12-22 02:39:25,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-22 02:39:25,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:25,651 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:39:25,655 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 (30)] Ended with exit code 0 [2023-12-22 02:39:25,855 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:39:25,855 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:25,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:25,856 INFO L85 PathProgramCache]: Analyzing trace with hash -249427950, now seen corresponding path program 1 times [2023-12-22 02:39:25,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:25,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815610572] [2023-12-22 02:39:25,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:25,856 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:39:25,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:25,857 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:39:25,858 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:39:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:25,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:39:25,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-22 02:39:25,994 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:25,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815610572] [2023-12-22 02:39:25,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815610572] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:25,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:25,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:39:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517474379] [2023-12-22 02:39:25,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:25,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:39:25,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:25,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:39:25,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:39:25,996 INFO L87 Difference]: Start difference. First operand 26603 states and 35224 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-22 02:39:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:27,270 INFO L93 Difference]: Finished difference Result 42500 states and 56590 transitions. [2023-12-22 02:39:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:39:27,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 164 [2023-12-22 02:39:27,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:27,309 INFO L225 Difference]: With dead ends: 42500 [2023-12-22 02:39:27,309 INFO L226 Difference]: Without dead ends: 15940 [2023-12-22 02:39:27,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 162 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:39:27,340 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 147 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:27,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 216 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:39:27,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15940 states. [2023-12-22 02:39:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15940 to 15940. [2023-12-22 02:39:28,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15940 states, 12561 states have (on average 1.2868402197277287) internal successors, (16164), 12808 states have internal predecessors, (16164), 1618 states have call successors, (1618), 1057 states have call predecessors, (1618), 1760 states have return successors, (3226), 2074 states have call predecessors, (3226), 1616 states have call successors, (3226) [2023-12-22 02:39:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15940 states to 15940 states and 21008 transitions. [2023-12-22 02:39:28,681 INFO L78 Accepts]: Start accepts. Automaton has 15940 states and 21008 transitions. Word has length 164 [2023-12-22 02:39:28,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:28,682 INFO L495 AbstractCegarLoop]: Abstraction has 15940 states and 21008 transitions. [2023-12-22 02:39:28,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-22 02:39:28,682 INFO L276 IsEmpty]: Start isEmpty. Operand 15940 states and 21008 transitions. [2023-12-22 02:39:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-22 02:39:28,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:28,690 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:39:28,697 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 (31)] Ended with exit code 0 [2023-12-22 02:39:28,894 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:39:28,894 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:28,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:28,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2004144056, now seen corresponding path program 2 times [2023-12-22 02:39:28,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:28,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836885237] [2023-12-22 02:39:28,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 02:39:28,976 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:39:28,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:28,978 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:39:29,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-22 02:39:29,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-22 02:39:29,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 02:39:29,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:39:29,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-12-22 02:39:29,067 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:29,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:29,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836885237] [2023-12-22 02:39:29,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836885237] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:29,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:29,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:39:29,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231703303] [2023-12-22 02:39:29,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:29,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:39:29,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:29,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:39:29,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:29,069 INFO L87 Difference]: Start difference. First operand 15940 states and 21008 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-22 02:39:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:31,300 INFO L93 Difference]: Finished difference Result 47042 states and 62104 transitions. [2023-12-22 02:39:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:31,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 164 [2023-12-22 02:39:31,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:31,383 INFO L225 Difference]: With dead ends: 47042 [2023-12-22 02:39:31,383 INFO L226 Difference]: Without dead ends: 31234 [2023-12-22 02:39:31,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 162 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:39:31,405 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 118 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:31,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 331 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31234 states. [2023-12-22 02:39:33,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31234 to 31185. [2023-12-22 02:39:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31185 states, 24538 states have (on average 1.2808297334746108) internal successors, (31429), 24951 states have internal predecessors, (31429), 3220 states have call successors, (3220), 2099 states have call predecessors, (3220), 3426 states have return successors, (6307), 4134 states have call predecessors, (6307), 3218 states have call successors, (6307) [2023-12-22 02:39:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31185 states to 31185 states and 40956 transitions. [2023-12-22 02:39:34,076 INFO L78 Accepts]: Start accepts. Automaton has 31185 states and 40956 transitions. Word has length 164 [2023-12-22 02:39:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:34,077 INFO L495 AbstractCegarLoop]: Abstraction has 31185 states and 40956 transitions. [2023-12-22 02:39:34,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-22 02:39:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 31185 states and 40956 transitions. [2023-12-22 02:39:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-22 02:39:34,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:34,083 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:39:34,086 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 (32)] Ended with exit code 0 [2023-12-22 02:39:34,286 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:39:34,286 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:34,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:34,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1613227086, now seen corresponding path program 1 times [2023-12-22 02:39:34,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:34,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800801900] [2023-12-22 02:39:34,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:34,287 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:39:34,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:34,288 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:39:34,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 (33)] Waiting until timeout for monitored process [2023-12-22 02:39:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:34,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:39:34,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-22 02:39:34,395 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:34,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:34,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800801900] [2023-12-22 02:39:34,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800801900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:34,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:34,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:39:34,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775162408] [2023-12-22 02:39:34,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:34,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:39:34,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:34,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:39:34,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:34,397 INFO L87 Difference]: Start difference. First operand 31185 states and 40956 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-22 02:39:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:36,712 INFO L93 Difference]: Finished difference Result 62021 states and 81458 transitions. [2023-12-22 02:39:36,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:36,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 164 [2023-12-22 02:39:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:36,791 INFO L225 Difference]: With dead ends: 62021 [2023-12-22 02:39:36,791 INFO L226 Difference]: Without dead ends: 30922 [2023-12-22 02:39:36,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 162 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:39:36,828 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 103 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 304 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:39:36,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 304 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:36,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30922 states. [2023-12-22 02:39:39,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30922 to 30918. [2023-12-22 02:39:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30918 states, 24289 states have (on average 1.2587179381613076) internal successors, (30573), 24766 states have internal predecessors, (30573), 3211 states have call successors, (3211), 2090 states have call predecessors, (3211), 3417 states have return successors, (5525), 4061 states have call predecessors, (5525), 3209 states have call successors, (5525) [2023-12-22 02:39:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30918 states to 30918 states and 39309 transitions. [2023-12-22 02:39:39,643 INFO L78 Accepts]: Start accepts. Automaton has 30918 states and 39309 transitions. Word has length 164 [2023-12-22 02:39:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:39,644 INFO L495 AbstractCegarLoop]: Abstraction has 30918 states and 39309 transitions. [2023-12-22 02:39:39,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-22 02:39:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 30918 states and 39309 transitions. [2023-12-22 02:39:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-22 02:39:39,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:39:39,646 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:39:39,650 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 (33)] Ended with exit code 0 [2023-12-22 02:39:39,849 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:39:39,850 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:39:39,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:39:39,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1394812706, now seen corresponding path program 1 times [2023-12-22 02:39:39,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:39:39,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255371217] [2023-12-22 02:39:39,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:39:39,851 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:39:39,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:39:39,852 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:39:39,856 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:39:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:39:39,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:39:39,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:39:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-22 02:39:39,967 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:39:39,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:39:39,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255371217] [2023-12-22 02:39:39,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255371217] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:39:39,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:39:39,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:39:39,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562725633] [2023-12-22 02:39:39,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:39:39,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:39:39,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:39:39,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:39:39,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:39:39,969 INFO L87 Difference]: Start difference. First operand 30918 states and 39309 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-22 02:39:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:39:40,674 INFO L93 Difference]: Finished difference Result 35439 states and 45041 transitions. [2023-12-22 02:39:40,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:39:40,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 171 [2023-12-22 02:39:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:39:40,676 INFO L225 Difference]: With dead ends: 35439 [2023-12-22 02:39:40,676 INFO L226 Difference]: Without dead ends: 0 [2023-12-22 02:39:40,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 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:39:40,698 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 74 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:39:40,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 209 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:39:40,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-22 02:39:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-22 02:39:40,698 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:39:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-22 02:39:40,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 171 [2023-12-22 02:39:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:39:40,700 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-22 02:39:40,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-22 02:39:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-22 02:39:40,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-22 02:39:40,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-22 02:39:40,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-22 02:39:40,708 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:39:40,915 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:39:40,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-22 02:40:12,721 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 915 925) no Hoare annotation was computed. [2023-12-22 02:40:12,721 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 915 925) no Hoare annotation was computed. [2023-12-22 02:40:12,724 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 915 925) the Hoare annotation is: (let ((.cse8 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse9 (and (= ~t1_st~0 |old(~t1_st~0)|) (= (_ bv2 32) ~m_st~0))) (.cse3 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse2 (not (= (_ bv2 32) ~T1_E~0))) (.cse4 (not (= (_ bv1 32) ~t1_i~0))) (.cse10 (not (= (_ bv0 32) ~m_pc~0))) (.cse5 (= |old(~m_st~0)| ~m_st~0)) (.cse6 (not (= (_ bv2 32) ~E_M~0))) (.cse7 (not (= ~c_dr_pc~0 (_ bv0 32))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~local~0 ~token~0)) (not (= (_ bv2 32) |old(~t1_st~0)|)) (and .cse5 (= ~t1_st~0 (_ bv2 32))) .cse6 .cse7) (or .cse8 .cse0 .cse9 .cse1 .cse2 .cse4 .cse10 .cse7) (or .cse8 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 (not (= (_ bv2 32) ~E_1~0)) .cse7 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (or .cse0 .cse1 .cse2 (not (= (_ bv0 32) |old(~t1_st~0)|)) .cse4 .cse10 (and .cse5 (= ~t1_st~0 (_ bv0 32))) .cse6 .cse7 (not (= ~t1_pc~0 (_ bv0 32)))))) [2023-12-22 02:40:12,724 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2023-12-22 02:40:12,724 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 49 53) no Hoare annotation was computed. [2023-12-22 02:40:12,724 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2023-12-22 02:40:12,724 INFO L899 garLoopResultBuilder]: For program point L44-2(lines 43 58) no Hoare annotation was computed. [2023-12-22 02:40:12,725 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 262 276) the Hoare annotation is: (let ((.cse22 (= (_ bv2 32) ~q_write_ev~0)) (.cse19 (= (_ bv2 32) ~q_read_ev~0)) (.cse20 (= ~q_req_up~0 (_ bv0 32)))) (let ((.cse6 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse4 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse10 (and .cse22 .cse19 .cse20)) (.cse11 (not (= |old(~q_req_up~0)| (_ bv0 32)))) (.cse0 (not (= (_ bv2 32) ~M_E~0))) (.cse1 (not (= (_ bv2 32) ~c_dr_st~0))) (.cse8 (not (= (_ bv0 32) ~m_st~0))) (.cse17 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse9 (not (= |old(~q_write_ev~0)| (_ bv2 32)))) (.cse2 (not (= (_ bv2 32) ~T1_E~0))) (.cse12 (not (= ~local~0 ~token~0))) (.cse3 (not (= (_ bv0 32) ~m_pc~0))) (.cse13 (not (= (_ bv2 32) |old(~q_read_ev~0)|))) (.cse18 (not (= ~q_free~0 (_ bv0 32)))) (.cse14 (not (= ~t1_st~0 (_ bv0 32)))) (.cse15 (not (= (_ bv2 32) ~E_1~0))) (.cse16 (not (= ~p_dw_i~0 (_ bv1 32)))) (.cse5 (not (= (_ bv2 32) ~E_M~0))) (.cse7 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse21 (not (= ~p_dw_st~0 (_ bv2 32))))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 (= |old(~q_read_ev~0)| ~q_read_ev~0)) .cse5 .cse6 .cse7) (or .cse0 (not (= ~p_dw_pc~0 (_ bv0 32))) .cse8 .cse9 (not (= ~p_dw_st~0 (_ bv0 32))) .cse2 (not (= ~c_dr_st~0 (_ bv0 32))) .cse10 .cse11 .cse12 .cse3 .cse13 .cse14 .cse15 .cse16 .cse5 .cse6 (not (= ~fast_clk_edge~0 (_ bv2 32))) .cse7 (not (= (_ bv2 32) ~slow_clk_edge~0))) (or .cse0 .cse1 .cse8 .cse17 .cse2 .cse11 .cse12 .cse3 .cse13 .cse18 (and .cse19 .cse4 .cse20) .cse14 .cse15 .cse16 .cse5 .cse7 .cse21) (or .cse0 (not (= ~p_dw_pc~0 (_ bv1 32))) .cse1 .cse8 .cse17 .cse9 .cse2 .cse10 .cse11 .cse12 .cse3 .cse13 .cse14 .cse15 .cse16 .cse5 .cse7 .cse21) (or .cse0 .cse1 .cse8 .cse17 .cse9 .cse2 (and .cse22 .cse19 (= ~q_req_up~0 |old(~q_req_up~0)|)) .cse12 .cse3 .cse13 .cse18 .cse14 .cse15 .cse16 .cse5 .cse7 .cse21)))) [2023-12-22 02:40:12,725 INFO L899 garLoopResultBuilder]: For program point L266-1(lines 262 276) no Hoare annotation was computed. [2023-12-22 02:40:12,725 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 709) no Hoare annotation was computed. [2023-12-22 02:40:12,725 INFO L899 garLoopResultBuilder]: For program point L898-2(lines 898 902) no Hoare annotation was computed. [2023-12-22 02:40:12,725 INFO L899 garLoopResultBuilder]: For program point L733(lines 721 735) no Hoare annotation was computed. [2023-12-22 02:40:12,725 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 728) no Hoare annotation was computed. [2023-12-22 02:40:12,725 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 890 914) the Hoare annotation is: (let ((.cse20 (= ~t1_st~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~m_st~0))) (let ((.cse8 (not (= ~local~0 ~token~0))) (.cse3 (and .cse20 .cse13)) (.cse0 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse17 (and (= ~t1_st~0 |old(~t1_st~0)|) .cse13)) (.cse14 (= ~t1_st~0 (_ bv2 32))) (.cse6 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse12 (not (= (_ bv2 32) |old(~t1_st~0)|))) (.cse9 (not (= (_ bv2 32) ~E_1~0))) (.cse19 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse2 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse4 (not (= (_ bv2 32) ~T1_E~0))) (.cse5 (not (= (_ bv0 32) |old(~t1_st~0)|))) (.cse7 (not (= (_ bv1 32) ~t1_i~0))) (.cse18 (not (= (_ bv0 32) ~m_pc~0))) (.cse15 (= |old(~m_st~0)| ~m_st~0)) (.cse10 (not (= (_ bv2 32) ~E_M~0))) (.cse11 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse16 (not (= ~t1_pc~0 (_ bv0 32))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse4 .cse7 .cse12 .cse9 .cse10 .cse11 (and .cse13 .cse14)) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse12 (and .cse15 .cse14) .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse16) (or .cse0 .cse1 .cse17 .cse2 .cse4 .cse7 .cse18 .cse11) (or .cse0 .cse1 .cse17 .cse2 .cse4 .cse6 .cse7 .cse9 .cse11 .cse19) (or (not (= |old(~m_st~0)| (_ bv0 32))) .cse1 .cse2 .cse4 (and (= (_ bv0 32) ~m_st~0) .cse14) .cse6 .cse7 .cse12 .cse9 .cse10 .cse11 .cse19) (or .cse1 .cse2 .cse4 .cse5 .cse7 .cse18 (and .cse15 .cse20) .cse10 .cse11 .cse16)))) [2023-12-22 02:40:12,725 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 712) no Hoare annotation was computed. [2023-12-22 02:40:12,725 INFO L899 garLoopResultBuilder]: For program point L703-2(lines 703 712) no Hoare annotation was computed. [2023-12-22 02:40:12,725 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 890 914) no Hoare annotation was computed. [2023-12-22 02:40:12,726 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 731) no Hoare annotation was computed. [2023-12-22 02:40:12,726 INFO L899 garLoopResultBuilder]: For program point L722-2(lines 722 731) no Hoare annotation was computed. [2023-12-22 02:40:12,726 INFO L899 garLoopResultBuilder]: For program point L714(lines 702 716) no Hoare annotation was computed. [2023-12-22 02:40:12,726 INFO L899 garLoopResultBuilder]: For program point L906(lines 906 910) no Hoare annotation was computed. [2023-12-22 02:40:12,726 INFO L899 garLoopResultBuilder]: For program point L906-2(lines 890 914) no Hoare annotation was computed. [2023-12-22 02:40:12,726 INFO L899 garLoopResultBuilder]: For program point L898(lines 898 902) no Hoare annotation was computed. [2023-12-22 02:40:12,726 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2023-12-22 02:40:12,726 INFO L899 garLoopResultBuilder]: For program point L403(lines 403 407) no Hoare annotation was computed. [2023-12-22 02:40:12,726 INFO L899 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2023-12-22 02:40:12,726 INFO L899 garLoopResultBuilder]: For program point L403-2(lines 387 411) no Hoare annotation was computed. [2023-12-22 02:40:12,726 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2023-12-22 02:40:12,726 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 387 411) the Hoare annotation is: (let ((.cse27 (= ~p_dw_st~0 (_ bv2 32))) (.cse25 (= (_ bv2 32) ~c_dr_st~0)) (.cse26 (= ~p_dw_st~0 (_ bv0 32))) (.cse28 (= ~c_dr_st~0 (_ bv0 32)))) (let ((.cse21 (and .cse26 .cse28)) (.cse1 (and .cse27 .cse25)) (.cse24 (and .cse27 .cse28)) (.cse20 (not (= |old(~c_dr_st~0)| (_ bv0 32)))) (.cse8 (not (= ~q_free~0 (_ bv0 32)))) (.cse16 (not (= (_ bv2 32) |old(~p_dw_st~0)|))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse17 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse3 (not (= (_ bv0 32) ~m_st~0))) (.cse4 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse18 (not (= |old(~p_dw_st~0)| (_ bv0 32)))) (.cse19 (and .cse26 .cse25)) (.cse6 (not (= ~local~0 ~token~0))) (.cse9 (not (= ~t1_st~0 (_ bv0 32)))) (.cse10 (not (= (_ bv2 32) ~E_1~0))) (.cse11 (not (= ~p_dw_i~0 (_ bv1 32)))) (.cse12 (not (= (_ bv2 32) ~q_read_ev~0))) (.cse22 (not (= (_ bv2 32) ~q_write_ev~0))) (.cse2 (not (= (_ bv2 32) ~M_E~0))) (.cse5 (not (= (_ bv2 32) ~T1_E~0))) (.cse7 (not (= (_ bv0 32) ~m_pc~0))) (.cse13 (not (= (_ bv2 32) ~E_M~0))) (.cse23 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse14 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse15 (not (= ~t1_pc~0 (_ bv0 32))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse17 .cse3 .cse4 .cse18 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse17 .cse3 .cse4 .cse18 .cse5 .cse20 .cse6 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse15) (or .cse2 .cse17 .cse3 .cse4 .cse18 .cse5 .cse20 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse15) (or .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14 .cse15 .cse16) (or .cse0 .cse2 (not (= ~p_dw_pc~0 (_ bv0 32))) .cse3 .cse18 .cse5 .cse20 .cse6 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse23 (not (= ~fast_clk_edge~0 (_ bv2 32))) .cse15 (not (= (_ bv2 32) ~slow_clk_edge~0))) (or .cse0 .cse2 .cse17 .cse3 .cse4 .cse18 .cse5 .cse20 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14 .cse15 .cse16) (or .cse2 .cse3 .cse4 .cse5 .cse24 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse15 .cse16) (or .cse2 .cse17 .cse3 .cse4 .cse18 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14 .cse15) (or .cse0 .cse2 .cse17 .cse3 .cse4 .cse5 .cse24 .cse20 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse24 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse0 .cse2 .cse17 .cse3 .cse4 .cse18 .cse19 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14 .cse15) (or .cse2 .cse5 (and (= ~p_dw_st~0 |old(~p_dw_st~0)|) .cse25) .cse7 .cse13 .cse23 .cse14 .cse15)))) [2023-12-22 02:40:12,727 INFO L895 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: (let ((.cse27 (= ~p_dw_st~0 (_ bv2 32))) (.cse25 (= (_ bv2 32) ~c_dr_st~0)) (.cse26 (= ~p_dw_st~0 (_ bv0 32))) (.cse28 (= ~c_dr_st~0 (_ bv0 32)))) (let ((.cse21 (and .cse26 .cse28)) (.cse1 (and .cse27 .cse25)) (.cse24 (and .cse27 .cse28)) (.cse20 (not (= |old(~c_dr_st~0)| (_ bv0 32)))) (.cse8 (not (= ~q_free~0 (_ bv0 32)))) (.cse16 (not (= (_ bv2 32) |old(~p_dw_st~0)|))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse17 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse3 (not (= (_ bv0 32) ~m_st~0))) (.cse4 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse18 (not (= |old(~p_dw_st~0)| (_ bv0 32)))) (.cse19 (and .cse26 .cse25)) (.cse6 (not (= ~local~0 ~token~0))) (.cse9 (not (= ~t1_st~0 (_ bv0 32)))) (.cse10 (not (= (_ bv2 32) ~E_1~0))) (.cse11 (not (= ~p_dw_i~0 (_ bv1 32)))) (.cse12 (not (= (_ bv2 32) ~q_read_ev~0))) (.cse22 (not (= (_ bv2 32) ~q_write_ev~0))) (.cse2 (not (= (_ bv2 32) ~M_E~0))) (.cse5 (not (= (_ bv2 32) ~T1_E~0))) (.cse7 (not (= (_ bv0 32) ~m_pc~0))) (.cse13 (not (= (_ bv2 32) ~E_M~0))) (.cse23 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse14 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse15 (not (= ~t1_pc~0 (_ bv0 32))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse17 .cse3 .cse4 .cse18 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse17 .cse3 .cse4 .cse18 .cse5 .cse20 .cse6 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse15) (or .cse2 .cse17 .cse3 .cse4 .cse18 .cse5 .cse20 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse15) (or .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14 .cse15 .cse16) (or .cse0 .cse2 (not (= ~p_dw_pc~0 (_ bv0 32))) .cse3 .cse18 .cse5 .cse20 .cse6 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse23 (not (= ~fast_clk_edge~0 (_ bv2 32))) .cse15 (not (= (_ bv2 32) ~slow_clk_edge~0))) (or .cse0 .cse2 .cse17 .cse3 .cse4 .cse18 .cse5 .cse20 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14 .cse15 .cse16) (or .cse2 .cse3 .cse4 .cse5 .cse24 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse15 .cse16) (or .cse2 .cse17 .cse3 .cse4 .cse18 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14 .cse15) (or .cse0 .cse2 .cse17 .cse3 .cse4 .cse5 .cse24 .cse20 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse24 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse0 .cse2 .cse17 .cse3 .cse4 .cse18 .cse19 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14 .cse15) (or .cse2 .cse5 (and (= ~p_dw_st~0 |old(~p_dw_st~0)|) .cse25) .cse7 .cse13 .cse23 .cse14 .cse15)))) [2023-12-22 02:40:12,727 INFO L895 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: (let ((.cse24 (= (_ bv2 32) ~c_dr_st~0)) (.cse35 (= ~p_dw_pc~0 (_ bv1 32))) (.cse26 (= ~p_dw_st~0 (_ bv2 32))) (.cse33 (= ~p_dw_st~0 (_ bv0 32))) (.cse34 (= ~c_dr_st~0 (_ bv0 32)))) (let ((.cse20 (and .cse33 .cse34)) (.cse18 (and .cse26 .cse34)) (.cse28 (and .cse35 .cse33 .cse34)) (.cse10 (not (= ~q_free~0 (_ bv0 32)))) (.cse30 (and .cse35 .cse33 .cse24)) (.cse23 (= ~p_dw_st~0 |old(~p_dw_st~0)|)) (.cse29 (and .cse26 .cse24)) (.cse22 (not (= (_ bv2 32) |old(~p_dw_st~0)|))) (.cse31 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse19 (not (= |old(~c_dr_st~0)| (_ bv0 32)))) (.cse32 (= activate_threads1_~tmp~1 (_ bv0 32))) (.cse25 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse27 (not (= ~fast_clk_edge~0 (_ bv2 32)))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (not (= (_ bv2 32) ~M_E~0))) (.cse2 (not .cse35)) (.cse3 (not (= (_ bv0 32) ~m_st~0))) (.cse4 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse5 (not (= |old(~p_dw_st~0)| (_ bv0 32)))) (.cse6 (and .cse33 .cse24)) (.cse7 (not (= (_ bv2 32) ~T1_E~0))) (.cse8 (not (= ~local~0 ~token~0))) (.cse9 (not (= (_ bv0 32) ~m_pc~0))) (.cse11 (not (= ~t1_st~0 (_ bv0 32)))) (.cse12 (not (= (_ bv2 32) ~E_1~0))) (.cse13 (not (= ~p_dw_i~0 (_ bv1 32)))) (.cse14 (not (= (_ bv2 32) ~q_read_ev~0))) (.cse15 (not (= (_ bv2 32) ~E_M~0))) (.cse21 (not (= (_ bv2 32) ~q_write_ev~0))) (.cse16 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse17 (not (= ~t1_pc~0 (_ bv0 32))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse18 .cse19 .cse8 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17 .cse22) (or .cse1 .cse6 .cse7 (and .cse23 .cse24) .cse9 .cse15 .cse25 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse19 .cse8 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse19 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse27 .cse16 .cse17 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse19 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse7 .cse18 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse14 .cse15 .cse17 .cse22) (or .cse0 .cse1 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse22) (or .cse29 .cse1 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse22 .cse30) (or .cse1 .cse3 .cse4 .cse7 .cse18 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse14 .cse15 .cse21 .cse17 .cse22) (or .cse1 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse27 .cse16 .cse17 .cse22) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17) (or .cse0 .cse29 .cse1 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse22 .cse30) (or .cse1 .cse31 (and .cse32 .cse23) .cse7 .cse9 .cse15 .cse25 .cse16 .cse17) (or .cse0 .cse29 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse22) (or .cse0 .cse1 .cse31 .cse3 .cse5 .cse7 .cse19 .cse8 .cse9 .cse11 (and .cse32 .cse33 .cse34) .cse12 .cse13 .cse14 .cse15 .cse21 .cse25 .cse27 .cse17 (not (= (_ bv2 32) ~slow_clk_edge~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17)))) [2023-12-22 02:40:12,727 INFO L899 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2023-12-22 02:40:12,727 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 737 744) no Hoare annotation was computed. [2023-12-22 02:40:12,727 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 737 744) the Hoare annotation is: true [2023-12-22 02:40:12,727 INFO L899 garLoopResultBuilder]: For program point L853-1(lines 834 861) no Hoare annotation was computed. [2023-12-22 02:40:12,727 INFO L899 garLoopResultBuilder]: For program point L848-1(lines 837 860) no Hoare annotation was computed. [2023-12-22 02:40:12,727 INFO L899 garLoopResultBuilder]: For program point L843-1(lines 837 860) no Hoare annotation was computed. [2023-12-22 02:40:12,727 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 834 861) the Hoare annotation is: (let ((.cse13 (= (_ bv2 32) ~E_M~0)) (.cse14 (= (_ bv2 32) ~T1_E~0)) (.cse15 (= |old(~M_E~0)| ~M_E~0))) (let ((.cse4 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse17 (not (= ~t1_st~0 (_ bv2 32)))) (.cse16 (not (= (_ bv0 32) ~m_st~0))) (.cse6 (not (= ~local~0 ~token~0))) (.cse12 (not (= (_ bv0 32) ~m_pc~0))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not (= (_ bv2 32) |old(~E_M~0)|))) (.cse2 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse3 (not (= (_ bv2 32) |old(~E_1~0)|))) (.cse5 (not (= (_ bv1 32) ~t1_i~0))) (.cse7 (not (= ~t1_st~0 (_ bv0 32)))) (.cse8 (not (= (_ bv2 32) |old(~T1_E~0)|))) (.cse9 (and .cse13 .cse14 .cse15 (= (_ bv2 32) ~E_1~0))) (.cse10 (not (= (_ bv2 32) ~m_st~0))) (.cse11 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse18 (not (= ~t1_pc~0 (_ bv0 32))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse5 .cse12 .cse8 .cse10 .cse11 (and .cse13 .cse14 .cse15)) (or .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse8 .cse9 .cse17 .cse11) (or .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse17 .cse11 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse8 .cse9 .cse17 .cse10 .cse11) (or .cse0 .cse16 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9 .cse11 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18)))) [2023-12-22 02:40:12,727 INFO L899 garLoopResultBuilder]: For program point L838-1(lines 837 860) no Hoare annotation was computed. [2023-12-22 02:40:12,727 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 834 861) no Hoare annotation was computed. [2023-12-22 02:40:12,727 INFO L899 garLoopResultBuilder]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2023-12-22 02:40:12,728 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 332) the Hoare annotation is: (let ((.cse14 (= (_ bv2 32) ~q_read_ev~0))) (let ((.cse4 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse6 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse8 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse0 (not (= (_ bv2 32) ~M_E~0))) (.cse1 (not (= (_ bv2 32) ~c_dr_st~0))) (.cse9 (not (= (_ bv0 32) ~m_st~0))) (.cse10 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse19 (not (= |old(~q_write_ev~0)| (_ bv2 32)))) (.cse2 (not (= (_ bv2 32) ~T1_E~0))) (.cse11 (not (= ~local~0 ~token~0))) (.cse3 (not (= (_ bv0 32) ~m_pc~0))) (.cse12 (not (= (_ bv2 32) |old(~q_read_ev~0)|))) (.cse13 (not (= ~q_free~0 (_ bv0 32)))) (.cse20 (and (= (_ bv2 32) ~q_write_ev~0) .cse14)) (.cse15 (not (= ~t1_st~0 (_ bv0 32)))) (.cse16 (not (= (_ bv2 32) ~E_1~0))) (.cse17 (not (= ~p_dw_i~0 (_ bv1 32)))) (.cse5 (not (= (_ bv2 32) ~E_M~0))) (.cse7 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse18 (not (= ~p_dw_st~0 (_ bv2 32))))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 (= |old(~q_read_ev~0)| ~q_read_ev~0)) .cse5 .cse6 .cse7) (or .cse8 .cse0 .cse1 .cse9 .cse10 .cse2 .cse11 .cse3 .cse12 .cse13 (and .cse14 .cse4) .cse15 .cse16 .cse17 .cse5 .cse7 .cse18) (or .cse8 .cse0 (not (= ~p_dw_pc~0 (_ bv0 32))) .cse9 .cse19 (not (= ~p_dw_st~0 (_ bv0 32))) .cse2 (not (= ~c_dr_st~0 (_ bv0 32))) .cse11 .cse3 .cse12 .cse20 .cse15 .cse16 .cse17 .cse5 .cse6 (not (= ~fast_clk_edge~0 (_ bv2 32))) .cse7 (not (= (_ bv2 32) ~slow_clk_edge~0))) (or .cse8 .cse0 (not (= ~p_dw_pc~0 (_ bv1 32))) .cse1 .cse9 .cse10 .cse19 .cse2 .cse11 .cse3 .cse12 .cse20 .cse15 .cse16 .cse17 .cse5 .cse7 .cse18) (or .cse0 .cse1 .cse9 .cse10 .cse19 .cse2 .cse11 .cse3 .cse12 .cse13 .cse20 .cse15 .cse16 .cse17 .cse5 .cse7 .cse18)))) [2023-12-22 02:40:12,728 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2023-12-22 02:40:12,728 INFO L899 garLoopResultBuilder]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2023-12-22 02:40:12,728 INFO L899 garLoopResultBuilder]: For program point L124(lines 102 126) no Hoare annotation was computed. [2023-12-22 02:40:12,728 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2023-12-22 02:40:12,728 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2023-12-22 02:40:12,728 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 99 127) the Hoare annotation is: true [2023-12-22 02:40:12,728 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2023-12-22 02:40:12,728 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2023-12-22 02:40:12,728 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2023-12-22 02:40:12,728 INFO L899 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2023-12-22 02:40:12,728 INFO L899 garLoopResultBuilder]: For program point L1026-2(lines 1026 1035) no Hoare annotation was computed. [2023-12-22 02:40:12,728 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2023-12-22 02:40:12,728 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2023-12-22 02:40:12,728 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 153 201) no Hoare annotation was computed. [2023-12-22 02:40:12,728 INFO L895 garLoopResultBuilder]: At program point L499-1(lines 499 536) the Hoare annotation is: (let ((.cse7 (= ~p_dw_pc~0 (_ bv1 32))) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse4 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse8 (= (_ bv2 32) ~q_write_ev~0)) (.cse9 (= (_ bv2 32) ~q_read_ev~0)) (.cse10 (= ~p_dw_i~0 (_ bv1 32))) (.cse11 (= ~t1_st~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse19 (= ~q_free~0 (_ bv0 32))) (.cse12 (= (_ bv0 32) ~m_st~0)) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse18 (= ~p_dw_st~0 (_ bv2 32))) (.cse14 (= ~c_dr_pc~0 (_ bv1 32))) (.cse15 (= (_ bv2 32) ~E_1~0)) (.cse3 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~local~0 ~token~0)) (.cse5 (= (_ bv2 32) ~c_dr_st~0)) (.cse6 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse16 .cse17 .cse5 .cse6) (and .cse0 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse16 .cse17 .cse6 .cse20) (and .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse17 .cse6 .cse20) (and .cse7 .cse0 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse5 .cse6) (and .cse0 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse16 .cse17 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse17 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse17 .cse6 .cse20) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse16 .cse17 .cse6 .cse20) (and .cse7 .cse0 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse6 .cse20) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse6 .cse20) (and .cse0 .cse8 .cse9 .cse10 (= (_ bv2 32) ~slow_clk_edge~0) .cse11 .cse1 .cse12 (= ~fast_clk_edge~0 (_ bv2 32)) .cse2 .cse13 .cse15 .cse3 .cse4 .cse16 .cse17 .cse6 .cse20 (= ~p_dw_pc~0 (_ bv0 32))) (and .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse17 .cse5 .cse6))) [2023-12-22 02:40:12,729 INFO L899 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2023-12-22 02:40:12,729 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1069) no Hoare annotation was computed. [2023-12-22 02:40:12,729 INFO L895 garLoopResultBuilder]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse1 (= ~t1_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~m_st~0)) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv0 32) ~m_st~0)) (.cse3 (= (_ bv2 32) ~T1_E~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~E_1~0)) (.cse6 (= (_ bv0 32) ~m_pc~0)) (.cse7 (= ~c_dr_pc~0 (_ bv0 32))) (.cse8 (= ~local~0 ~token~0)) (.cse13 (= ~t1_st~0 (_ bv2 32))) (.cse14 (= ~t1_pc~0 (_ bv1 32))) (.cse9 (= (_ bv1 32) ~t1_i~0)) (.cse11 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse8 .cse14 .cse9 .cse11) (and .cse0 .cse3 .cse4 .cse6 .cse7 .cse12 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse9 .cse10 .cse11) (and .cse0 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse7 .cse13 .cse14 .cse9 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse9 .cse11))) [2023-12-22 02:40:12,729 INFO L899 garLoopResultBuilder]: For program point L1030-1(line 1030) no Hoare annotation was computed. [2023-12-22 02:40:12,729 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 663 698) no Hoare annotation was computed. [2023-12-22 02:40:12,729 INFO L899 garLoopResultBuilder]: For program point L799-1(lines 789 827) no Hoare annotation was computed. [2023-12-22 02:40:12,729 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 675) no Hoare annotation was computed. [2023-12-22 02:40:12,729 INFO L895 garLoopResultBuilder]: At program point L172-1(lines 172 195) the Hoare annotation is: (let ((.cse11 (= ~q_free~0 (_ bv0 32))) (.cse4 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~c_dr_st~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse7 (= (_ bv2 32) ~q_write_ev~0)) (.cse8 (= (_ bv2 32) ~q_read_ev~0)) (.cse9 (= ~p_dw_i~0 (_ bv1 32))) (.cse17 (= (_ bv2 32) ~slow_clk_edge~0)) (.cse10 (= ~t1_st~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse12 (= (_ bv0 32) ~m_st~0)) (.cse18 (= ~fast_clk_edge~0 (_ bv2 32))) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~c_dr_pc~0 (_ bv1 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse3 (= (_ bv0 32) ~m_pc~0)) (.cse19 (= ~q_req_up~0 (_ bv0 32))) (.cse15 (= ~local~0 ~token~0)) (.cse5 (= (_ bv2 32) ~c_dr_st~0)) (.cse6 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse12 .cse2 .cse13 .cse14 .cse3 .cse15 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse12 .cse2 .cse13 .cse14 .cse3 .cse15 .cse6 .cse16) (and .cse0 .cse7 .cse8 .cse9 .cse17 .cse10 .cse1 .cse12 .cse18 .cse2 .cse14 .cse3 .cse4 .cse19 .cse15 .cse6 .cse16) (and .cse0 .cse7 .cse8 .cse9 .cse17 .cse10 .cse1 .cse12 .cse18 .cse2 .cse13 .cse14 .cse3 .cse19 .cse15 .cse5 .cse6))) [2023-12-22 02:40:12,729 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 992 1050) no Hoare annotation was computed. [2023-12-22 02:40:12,729 INFO L899 garLoopResultBuilder]: For program point L1065(lines 1065 1068) no Hoare annotation was computed. [2023-12-22 02:40:12,729 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 619 662) no Hoare annotation was computed. [2023-12-22 02:40:12,729 INFO L895 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 (_ bv1 32))) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse15 (= ~q_req_up~0 (_ bv0 32))) (.cse19 (= ~c_dr_st~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse7 (= (_ bv2 32) ~q_write_ev~0)) (.cse8 (= (_ bv2 32) ~q_read_ev~0)) (.cse9 (= ~p_dw_i~0 (_ bv1 32))) (.cse10 (= ~t1_st~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse18 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse17 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~c_dr_pc~0 (_ bv1 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse3 (= (_ bv0 32) ~m_pc~0)) (.cse16 (= ~local~0 ~token~0)) (.cse4 (= (_ bv2 32) ~c_dr_st~0)) (.cse5 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 (_ bv0 32)) .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse16 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse16 .cse4 .cse5))) [2023-12-22 02:40:12,729 INFO L899 garLoopResultBuilder]: For program point L471-1(line 471) no Hoare annotation was computed. [2023-12-22 02:40:12,729 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2023-12-22 02:40:12,729 INFO L895 garLoopResultBuilder]: At program point L1000(line 1000) the Hoare annotation is: (and (= (_ bv2 32) ~E_M~0) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~p_dw_st~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)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-22 02:40:12,729 INFO L899 garLoopResultBuilder]: For program point L1000-1(line 1000) no Hoare annotation was computed. [2023-12-22 02:40:12,730 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 809) no Hoare annotation was computed. [2023-12-22 02:40:12,730 INFO L899 garLoopResultBuilder]: For program point L802-2(lines 802 809) no Hoare annotation was computed. [2023-12-22 02:40:12,730 INFO L899 garLoopResultBuilder]: For program point L670(lines 670 674) no Hoare annotation was computed. [2023-12-22 02:40:12,730 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 484 542) no Hoare annotation was computed. [2023-12-22 02:40:12,730 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 377) no Hoare annotation was computed. [2023-12-22 02:40:12,730 INFO L899 garLoopResultBuilder]: For program point L373-2(lines 372 385) no Hoare annotation was computed. [2023-12-22 02:40:12,730 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 478) no Hoare annotation was computed. [2023-12-22 02:40:12,730 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2023-12-22 02:40:12,730 INFO L895 garLoopResultBuilder]: At program point L1002(line 1002) the Hoare annotation is: (let ((.cse0 (= (_ bv2 32) ~E_M~0)) (.cse1 (= ~t1_st~0 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~M_E~0)) (.cse3 (= (_ bv2 32) ~T1_E~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (= (_ bv0 32) ~m_pc~0)) (.cse6 (= ~c_dr_pc~0 (_ bv0 32))) (.cse7 (= (_ bv1 32) ~t1_i~0)) (.cse8 (= ~t1_pc~0 (_ bv0 32))) (.cse9 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv2 32) ~m_st~0) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= (_ bv0 32) ~m_st~0) .cse3 .cse4 (= (_ bv2 32) ~E_1~0) .cse5 .cse6 (= ~local~0 ~token~0) .cse7 .cse8 .cse9))) [2023-12-22 02:40:12,730 INFO L895 garLoopResultBuilder]: At program point L1002-1(line 1002) the Hoare annotation is: (let ((.cse0 (= (_ bv2 32) ~E_M~0)) (.cse1 (= ~t1_st~0 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~M_E~0)) (.cse3 (= (_ bv2 32) ~T1_E~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (= (_ bv0 32) ~m_pc~0)) (.cse6 (= ~c_dr_pc~0 (_ bv0 32))) (.cse7 (= (_ bv1 32) ~t1_i~0)) (.cse8 (= ~t1_pc~0 (_ bv0 32))) (.cse9 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv2 32) ~m_st~0) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= (_ bv0 32) ~m_st~0) .cse3 .cse4 (= (_ bv2 32) ~E_1~0) .cse5 .cse6 (= ~local~0 ~token~0) .cse7 .cse8 .cse9))) [2023-12-22 02:40:12,730 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 783 833) no Hoare annotation was computed. [2023-12-22 02:40:12,730 INFO L895 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse14 (= ~q_req_up~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse6 (= (_ bv2 32) ~q_write_ev~0)) (.cse7 (= (_ bv2 32) ~q_read_ev~0)) (.cse8 (= ~p_dw_i~0 (_ bv1 32))) (.cse9 (= ~t1_st~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse16 (= ~q_free~0 (_ bv0 32))) (.cse10 (= (_ bv0 32) ~m_st~0)) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_dw_st~0 (_ bv2 32))) (.cse12 (= ~c_dr_pc~0 (_ bv1 32))) (.cse13 (= (_ bv2 32) ~E_1~0)) (.cse3 (= (_ bv0 32) ~m_pc~0)) (.cse15 (= ~local~0 ~token~0)) (.cse4 (= (_ bv2 32) ~c_dr_st~0)) (.cse5 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 (_ bv0 32)) .cse4 .cse5) (and (= ~p_dw_pc~0 (_ bv1 32)) .cse0 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse2 .cse11 .cse12 .cse13 .cse3 .cse14 .cse15 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse1 .cse16 .cse10 .cse2 .cse11 .cse12 .cse13 .cse3 .cse14 .cse15 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse8 .cse9 .cse1 .cse16 .cse10 .cse2 .cse11 .cse12 .cse13 .cse3 .cse15 .cse4 .cse5))) [2023-12-22 02:40:12,730 INFO L899 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2023-12-22 02:40:12,731 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2023-12-22 02:40:12,731 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 214) no Hoare annotation was computed. [2023-12-22 02:40:12,731 INFO L895 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (let ((.cse0 (= (_ bv2 32) ~E_M~0)) (.cse1 (= ~t1_st~0 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~M_E~0)) (.cse3 (= (_ bv2 32) ~T1_E~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (= (_ bv0 32) ~m_pc~0)) (.cse6 (= ~c_dr_pc~0 (_ bv0 32))) (.cse7 (= (_ bv1 32) ~t1_i~0)) (.cse8 (= ~t1_pc~0 (_ bv0 32))) (.cse9 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv2 32) ~m_st~0) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= (_ bv0 32) ~m_st~0) .cse3 .cse4 (= (_ bv2 32) ~E_1~0) .cse5 .cse6 (= ~local~0 ~token~0) .cse7 .cse8 .cse9))) [2023-12-22 02:40:12,731 INFO L895 garLoopResultBuilder]: At program point L640(line 640) the Hoare annotation is: (let ((.cse0 (= (_ bv2 32) ~E_M~0)) (.cse1 (= (_ bv2 32) ~T1_E~0)) (.cse2 (= ~p_dw_st~0 (_ bv0 32))) (.cse3 (= ~c_dr_pc~0 (_ bv0 32))) (.cse4 (= (_ bv1 32) ~t1_i~0)) (.cse5 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~local~0 ~token~0) (= ~t1_st~0 (_ bv2 32)) (= ~t1_pc~0 (_ bv1 32)) .cse4 .cse5) (and .cse0 (= ~t1_st~0 (_ bv0 32)) .cse1 .cse2 (= (_ bv0 32) ~m_pc~0) .cse3 .cse4 (= ~t1_pc~0 (_ bv0 32)) .cse5))) [2023-12-22 02:40:12,731 INFO L899 garLoopResultBuilder]: For program point L640-1(line 640) no Hoare annotation was computed. [2023-12-22 02:40:12,731 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 203 261) no Hoare annotation was computed. [2023-12-22 02:40:12,731 INFO L895 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse7 (= ~p_dw_pc~0 (_ bv1 32))) (.cse21 (= (_ bv2 32) ~slow_clk_edge~0)) (.cse22 (= ~fast_clk_edge~0 (_ bv2 32))) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse4 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse23 (= ~p_dw_pc~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse8 (= (_ bv2 32) ~q_write_ev~0)) (.cse9 (= (_ bv2 32) ~q_read_ev~0)) (.cse10 (= ~p_dw_i~0 (_ bv1 32))) (.cse11 (= ~t1_st~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse19 (= ~q_free~0 (_ bv0 32))) (.cse12 (= (_ bv0 32) ~m_st~0)) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse18 (= ~p_dw_st~0 (_ bv2 32))) (.cse14 (= ~c_dr_pc~0 (_ bv1 32))) (.cse15 (= (_ bv2 32) ~E_1~0)) (.cse3 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~local~0 ~token~0)) (.cse5 (= (_ bv2 32) ~c_dr_st~0)) (.cse6 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse16 .cse17 .cse5 .cse6) (and .cse0 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse16 .cse17 .cse6 .cse20) (and .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse17 .cse6 .cse20) (and .cse7 .cse0 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse5 .cse6) (and .cse0 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse16 .cse17 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse21 .cse11 .cse1 .cse12 .cse22 .cse2 .cse18 .cse15 .cse3 .cse4 .cse16 .cse17 .cse6 .cse20) (and .cse0 .cse8 .cse9 .cse10 .cse21 .cse11 .cse1 .cse12 .cse22 .cse2 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse5 .cse6 .cse23) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse17 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse17 .cse6 .cse20) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse16 .cse17 .cse6 .cse20) (and .cse7 .cse0 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse6 .cse20) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse6 .cse20) (and .cse0 .cse8 .cse9 .cse10 .cse21 .cse11 .cse1 .cse12 .cse22 .cse2 .cse13 .cse15 .cse3 .cse4 .cse16 .cse17 .cse6 .cse20 .cse23) (and .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse17 .cse5 .cse6))) [2023-12-22 02:40:12,732 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 187) no Hoare annotation was computed. [2023-12-22 02:40:12,732 INFO L899 garLoopResultBuilder]: For program point L939(lines 939 943) no Hoare annotation was computed. [2023-12-22 02:40:12,732 INFO L899 garLoopResultBuilder]: For program point L939-2(lines 938 961) no Hoare annotation was computed. [2023-12-22 02:40:12,732 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 412 464) no Hoare annotation was computed. [2023-12-22 02:40:12,732 INFO L899 garLoopResultBuilder]: For program point L378-1(lines 369 386) no Hoare annotation was computed. [2023-12-22 02:40:12,732 INFO L899 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2023-12-22 02:40:12,732 INFO L895 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse14 (= ~q_req_up~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse6 (= (_ bv2 32) ~q_write_ev~0)) (.cse7 (= (_ bv2 32) ~q_read_ev~0)) (.cse8 (= ~p_dw_i~0 (_ bv1 32))) (.cse9 (= ~t1_st~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse16 (= ~q_free~0 (_ bv0 32))) (.cse10 (= (_ bv0 32) ~m_st~0)) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_dw_st~0 (_ bv2 32))) (.cse12 (= ~c_dr_pc~0 (_ bv1 32))) (.cse13 (= (_ bv2 32) ~E_1~0)) (.cse3 (= (_ bv0 32) ~m_pc~0)) (.cse15 (= ~local~0 ~token~0)) (.cse4 (= (_ bv2 32) ~c_dr_st~0)) (.cse5 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 (_ bv0 32)) .cse4 .cse5) (and (= ~p_dw_pc~0 (_ bv1 32)) .cse0 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse2 .cse11 .cse12 .cse13 .cse3 .cse14 .cse15 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse1 .cse16 .cse10 .cse2 .cse11 .cse12 .cse13 .cse3 .cse14 .cse15 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse8 .cse9 .cse1 .cse16 .cse10 .cse2 .cse11 .cse12 .cse13 .cse3 .cse15 .cse4 .cse5))) [2023-12-22 02:40:12,732 INFO L895 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse14 (= ~q_req_up~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse6 (= (_ bv2 32) ~q_write_ev~0)) (.cse7 (= (_ bv2 32) ~q_read_ev~0)) (.cse8 (= ~p_dw_i~0 (_ bv1 32))) (.cse9 (= ~t1_st~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse16 (= ~q_free~0 (_ bv0 32))) (.cse10 (= (_ bv0 32) ~m_st~0)) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_dw_st~0 (_ bv2 32))) (.cse12 (= ~c_dr_pc~0 (_ bv1 32))) (.cse13 (= (_ bv2 32) ~E_1~0)) (.cse3 (= (_ bv0 32) ~m_pc~0)) (.cse15 (= ~local~0 ~token~0)) (.cse4 (= (_ bv2 32) ~c_dr_st~0)) (.cse5 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 (_ bv0 32)) .cse4 .cse5) (and (= ~p_dw_pc~0 (_ bv1 32)) .cse0 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse2 .cse11 .cse12 .cse13 .cse3 .cse14 .cse15 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse1 .cse16 .cse10 .cse2 .cse11 .cse12 .cse13 .cse3 .cse14 .cse15 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse8 .cse9 .cse1 .cse16 .cse10 .cse2 .cse11 .cse12 .cse13 .cse3 .cse15 .cse4 .cse5))) [2023-12-22 02:40:12,732 INFO L895 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2023-12-22 02:40:12,732 INFO L895 garLoopResultBuilder]: At program point L1007-1(lines 1007 1044) the Hoare annotation is: (let ((.cse1 (= ~t1_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~m_st~0)) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv0 32) ~m_st~0)) (.cse3 (= (_ bv2 32) ~T1_E~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~E_1~0)) (.cse6 (= (_ bv0 32) ~m_pc~0)) (.cse7 (= ~c_dr_pc~0 (_ bv0 32))) (.cse8 (= ~local~0 ~token~0)) (.cse13 (= ~t1_st~0 (_ bv2 32))) (.cse14 (= ~t1_pc~0 (_ bv1 32))) (.cse9 (= (_ bv1 32) ~t1_i~0)) (.cse11 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse8 .cse14 .cse9 .cse11) (and .cse0 .cse3 .cse4 .cse6 .cse7 .cse12 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse9 .cse10 .cse11) (and .cse0 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse7 .cse13 .cse14 .cse9 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse9 .cse11))) [2023-12-22 02:40:12,732 INFO L895 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 (_ bv1 32))) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse15 (= ~q_req_up~0 (_ bv0 32))) (.cse19 (= ~c_dr_st~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse7 (= (_ bv2 32) ~q_write_ev~0)) (.cse8 (= (_ bv2 32) ~q_read_ev~0)) (.cse9 (= ~p_dw_i~0 (_ bv1 32))) (.cse10 (= ~t1_st~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse18 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse17 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~c_dr_pc~0 (_ bv1 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse3 (= (_ bv0 32) ~m_pc~0)) (.cse16 (= ~local~0 ~token~0)) (.cse4 (= (_ bv2 32) ~c_dr_st~0)) (.cse5 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 (_ bv0 32)) .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse16 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse16 .cse4 .cse5))) [2023-12-22 02:40:12,732 INFO L899 garLoopResultBuilder]: For program point L281(lines 281 285) no Hoare annotation was computed. [2023-12-22 02:40:12,732 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 280 293) no Hoare annotation was computed. [2023-12-22 02:40:12,732 INFO L895 garLoopResultBuilder]: At program point L678-1(lines 678 691) the Hoare annotation is: (let ((.cse8 (= (_ bv0 32) ~m_st~0)) (.cse3 (= (_ bv2 32) ~E_1~0)) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse1 (= (_ bv2 32) ~T1_E~0)) (.cse2 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv0 32) ~m_pc~0)) (.cse4 (= ~c_dr_pc~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~m_st~0)) (.cse6 (= (_ bv1 32) ~t1_i~0)) (.cse7 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse8 .cse1 .cse2 .cse3 .cse4 (= ~t1_pc~0 (_ bv1 32)) .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse9 .cse4 (= ~local~0 ~token~0) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5 .cse6 .cse7))) [2023-12-22 02:40:12,733 INFO L895 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 (_ bv1 32))) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse15 (= ~q_req_up~0 (_ bv0 32))) (.cse19 (= ~c_dr_st~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse7 (= (_ bv2 32) ~q_write_ev~0)) (.cse8 (= (_ bv2 32) ~q_read_ev~0)) (.cse9 (= ~p_dw_i~0 (_ bv1 32))) (.cse10 (= ~t1_st~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse18 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse17 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~c_dr_pc~0 (_ bv1 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse3 (= (_ bv0 32) ~m_pc~0)) (.cse16 (= ~local~0 ~token~0)) (.cse4 (= (_ bv2 32) ~c_dr_st~0)) (.cse5 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 (_ bv0 32)) .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse16 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse16 .cse4 .cse5))) [2023-12-22 02:40:12,733 INFO L899 garLoopResultBuilder]: For program point L480(lines 469 482) no Hoare annotation was computed. [2023-12-22 02:40:12,733 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2023-12-22 02:40:12,733 INFO L899 garLoopResultBuilder]: For program point L944-1(lines 938 961) no Hoare annotation was computed. [2023-12-22 02:40:12,733 INFO L895 garLoopResultBuilder]: At program point L813-1(lines 789 827) the Hoare annotation is: (let ((.cse1 (= ~t1_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~m_st~0)) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv0 32) ~m_st~0)) (.cse3 (= (_ bv2 32) ~T1_E~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~E_1~0)) (.cse6 (= (_ bv0 32) ~m_pc~0)) (.cse7 (= ~c_dr_pc~0 (_ bv0 32))) (.cse8 (= ~local~0 ~token~0)) (.cse13 (= ~t1_st~0 (_ bv2 32))) (.cse14 (= ~t1_pc~0 (_ bv1 32))) (.cse9 (= (_ bv1 32) ~t1_i~0)) (.cse11 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse8 .cse14 .cse9 .cse11) (and .cse0 .cse3 .cse4 .cse6 .cse7 .cse12 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse9 .cse10 .cse11) (and .cse0 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse7 .cse13 .cse14 .cse9 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse9 .cse11))) [2023-12-22 02:40:12,733 INFO L895 garLoopResultBuilder]: At program point L648-1(lines 634 655) the Hoare annotation is: (let ((.cse4 (= (_ bv0 32) ~m_pc~0)) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse1 (= (_ bv2 32) ~T1_E~0)) (.cse2 (= ~p_dw_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~E_1~0)) (.cse5 (= ~c_dr_pc~0 (_ bv0 32))) (.cse6 (= ~t1_st~0 (_ bv2 32))) (.cse7 (= ~t1_pc~0 (_ bv1 32))) (.cse8 (= (_ bv1 32) ~t1_i~0)) (.cse9 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~local~0 ~token~0) .cse6 .cse7 .cse8 .cse9) (and .cse0 (= ~t1_st~0 (_ bv0 32)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 (= ~t1_pc~0 (_ bv0 32)) .cse9) (and .cse0 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9))) [2023-12-22 02:40:12,733 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2023-12-22 02:40:12,733 INFO L895 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2023-12-22 02:40:12,733 INFO L895 garLoopResultBuilder]: At program point L252-1(lines 218 255) the Hoare annotation is: (let ((.cse6 (= ~q_free~0 (_ bv0 32))) (.cse9 (= ~p_dw_st~0 (_ bv0 32))) (.cse10 (= ~c_dr_pc~0 (_ bv1 32))) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse16 (= (_ bv2 32) ~q_write_ev~0)) (.cse2 (= (_ bv2 32) ~q_read_ev~0)) (.cse3 (= ~p_dw_i~0 (_ bv1 32))) (.cse18 (= (_ bv2 32) ~slow_clk_edge~0)) (.cse4 (= ~t1_st~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~M_E~0)) (.cse7 (= (_ bv0 32) ~m_st~0)) (.cse19 (= ~fast_clk_edge~0 (_ bv2 32))) (.cse8 (= (_ bv2 32) ~T1_E~0)) (.cse17 (= ~p_dw_st~0 (_ bv2 32))) (.cse11 (= (_ bv2 32) ~E_1~0)) (.cse12 (= (_ bv0 32) ~m_pc~0)) (.cse13 (= ~q_req_up~0 (_ bv0 32))) (.cse14 (= ~local~0 ~token~0)) (.cse15 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse16 .cse2 .cse3 .cse18 .cse4 .cse5 .cse7 .cse19 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~p_dw_pc~0 (_ bv0 32))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse0 .cse1 .cse16 .cse2 .cse3 .cse18 .cse4 .cse5 .cse7 .cse19 .cse8 .cse17 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-22 02:40:12,733 INFO L895 garLoopResultBuilder]: At program point L979(line 979) the Hoare annotation is: (let ((.cse1 (= ~t1_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~m_st~0)) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv0 32) ~m_st~0)) (.cse3 (= (_ bv2 32) ~T1_E~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~E_1~0)) (.cse6 (= (_ bv0 32) ~m_pc~0)) (.cse7 (= ~c_dr_pc~0 (_ bv0 32))) (.cse8 (= ~local~0 ~token~0)) (.cse13 (= ~t1_st~0 (_ bv2 32))) (.cse14 (= ~t1_pc~0 (_ bv1 32))) (.cse9 (= (_ bv1 32) ~t1_i~0)) (.cse11 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse8 .cse14 .cse9 .cse11) (and .cse0 .cse3 .cse4 .cse6 .cse7 .cse12 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse9 .cse10 .cse11) (and .cse0 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse7 .cse13 .cse14 .cse9 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse9 .cse11))) [2023-12-22 02:40:12,733 INFO L899 garLoopResultBuilder]: For program point L979-1(line 979) no Hoare annotation was computed. [2023-12-22 02:40:12,733 INFO L899 garLoopResultBuilder]: For program point L286-1(lines 277 294) no Hoare annotation was computed. [2023-12-22 02:40:12,733 INFO L899 garLoopResultBuilder]: For program point L749(lines 749 753) no Hoare annotation was computed. [2023-12-22 02:40:12,733 INFO L899 garLoopResultBuilder]: For program point L749-2(lines 748 761) no Hoare annotation was computed. [2023-12-22 02:40:12,734 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 527) no Hoare annotation was computed. [2023-12-22 02:40:12,734 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2023-12-22 02:40:12,734 INFO L895 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse7 (= ~p_dw_pc~0 (_ bv1 32))) (.cse21 (= (_ bv2 32) ~slow_clk_edge~0)) (.cse22 (= ~fast_clk_edge~0 (_ bv2 32))) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse4 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse23 (= ~p_dw_pc~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse8 (= (_ bv2 32) ~q_write_ev~0)) (.cse9 (= (_ bv2 32) ~q_read_ev~0)) (.cse10 (= ~p_dw_i~0 (_ bv1 32))) (.cse11 (= ~t1_st~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse19 (= ~q_free~0 (_ bv0 32))) (.cse12 (= (_ bv0 32) ~m_st~0)) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse18 (= ~p_dw_st~0 (_ bv2 32))) (.cse14 (= ~c_dr_pc~0 (_ bv1 32))) (.cse15 (= (_ bv2 32) ~E_1~0)) (.cse3 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~local~0 ~token~0)) (.cse5 (= (_ bv2 32) ~c_dr_st~0)) (.cse6 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse16 .cse17 .cse5 .cse6) (and .cse0 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse16 .cse17 .cse6 .cse20) (and .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse17 .cse6 .cse20) (and .cse7 .cse0 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse5 .cse6) (and .cse0 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse16 .cse17 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse21 .cse11 .cse1 .cse12 .cse22 .cse2 .cse18 .cse15 .cse3 .cse4 .cse16 .cse17 .cse6 .cse20) (and .cse0 .cse8 .cse9 .cse10 .cse21 .cse11 .cse1 .cse12 .cse22 .cse2 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse5 .cse6 .cse23) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse17 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse17 .cse6 .cse20) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse16 .cse17 .cse6 .cse20) (and .cse7 .cse0 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse6 .cse20) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse6 .cse20) (and .cse0 .cse8 .cse9 .cse10 .cse21 .cse11 .cse1 .cse12 .cse22 .cse2 .cse13 .cse15 .cse3 .cse4 .cse16 .cse17 .cse6 .cse20 .cse23) (and .cse0 .cse8 .cse9 .cse10 .cse11 .cse1 .cse19 .cse12 .cse2 .cse18 .cse14 .cse15 .cse3 .cse17 .cse5 .cse6))) [2023-12-22 02:40:12,734 INFO L899 garLoopResultBuilder]: For program point L981(lines 981 986) no Hoare annotation was computed. [2023-12-22 02:40:12,734 INFO L899 garLoopResultBuilder]: For program point L816(lines 816 823) no Hoare annotation was computed. [2023-12-22 02:40:12,734 INFO L899 garLoopResultBuilder]: For program point L816-2(lines 816 823) no Hoare annotation was computed. [2023-12-22 02:40:12,734 INFO L895 garLoopResultBuilder]: At program point L1015(line 1015) the Hoare annotation is: (let ((.cse1 (= ~t1_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~m_st~0)) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv0 32) ~m_st~0)) (.cse3 (= (_ bv2 32) ~T1_E~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~E_1~0)) (.cse6 (= (_ bv0 32) ~m_pc~0)) (.cse7 (= ~c_dr_pc~0 (_ bv0 32))) (.cse8 (= ~local~0 ~token~0)) (.cse13 (= ~t1_st~0 (_ bv2 32))) (.cse14 (= ~t1_pc~0 (_ bv1 32))) (.cse9 (= (_ bv1 32) ~t1_i~0)) (.cse11 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse8 .cse14 .cse9 .cse11) (and .cse0 .cse3 .cse4 .cse6 .cse7 .cse12 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse9 .cse10 .cse11) (and .cse0 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse7 .cse13 .cse14 .cse9 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse9 .cse11))) [2023-12-22 02:40:12,734 INFO L899 garLoopResultBuilder]: For program point L1015-1(line 1015) no Hoare annotation was computed. [2023-12-22 02:40:12,734 INFO L899 garLoopResultBuilder]: For program point L949-1(lines 938 961) no Hoare annotation was computed. [2023-12-22 02:40:12,734 INFO L899 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2023-12-22 02:40:12,734 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-22 02:40:12,734 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2023-12-22 02:40:12,734 INFO L895 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 (_ bv1 32))) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse15 (= ~q_req_up~0 (_ bv0 32))) (.cse19 (= ~c_dr_st~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse7 (= (_ bv2 32) ~q_write_ev~0)) (.cse8 (= (_ bv2 32) ~q_read_ev~0)) (.cse9 (= ~p_dw_i~0 (_ bv1 32))) (.cse10 (= ~t1_st~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse18 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse17 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~c_dr_pc~0 (_ bv1 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse3 (= (_ bv0 32) ~m_pc~0)) (.cse16 (= ~local~0 ~token~0)) (.cse4 (= (_ bv2 32) ~c_dr_st~0)) (.cse5 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 (_ bv0 32)) .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse16 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse2 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse19) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse18 .cse11 .cse2 .cse17 .cse13 .cse14 .cse3 .cse16 .cse4 .cse5))) [2023-12-22 02:40:12,734 INFO L899 garLoopResultBuilder]: For program point L522-1(line 522) no Hoare annotation was computed. [2023-12-22 02:40:12,734 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-12-22 02:40:12,734 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2023-12-22 02:40:12,735 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2023-12-22 02:40:12,735 INFO L899 garLoopResultBuilder]: For program point L357-2(lines 353 368) no Hoare annotation was computed. [2023-12-22 02:40:12,735 INFO L899 garLoopResultBuilder]: For program point L754-1(lines 745 762) no Hoare annotation was computed. [2023-12-22 02:40:12,735 INFO L895 garLoopResultBuilder]: At program point L688(line 688) the Hoare annotation is: (let ((.cse0 (= (_ bv2 32) ~T1_E~0)) (.cse1 (= ~p_dw_st~0 (_ bv0 32))) (.cse2 (= ~c_dr_pc~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~m_st~0)) (.cse4 (= (_ bv1 32) ~t1_i~0)) (.cse5 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse0 .cse1 (= (_ bv2 32) ~E_1~0) .cse2 .cse3 (= ~t1_pc~0 (_ bv1 32)) .cse4 .cse5) (and .cse0 .cse1 (= (_ bv0 32) ~m_pc~0) .cse2 .cse3 .cse4 .cse5))) [2023-12-22 02:40:12,735 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 179 187) no Hoare annotation was computed. [2023-12-22 02:40:12,735 INFO L899 garLoopResultBuilder]: For program point L688-1(line 688) no Hoare annotation was computed. [2023-12-22 02:40:12,735 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2023-12-22 02:40:12,735 INFO L895 garLoopResultBuilder]: At program point L1019(line 1019) the Hoare annotation is: (let ((.cse1 (= ~t1_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~m_st~0)) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv0 32) ~m_st~0)) (.cse3 (= (_ bv2 32) ~T1_E~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~E_1~0)) (.cse6 (= (_ bv0 32) ~m_pc~0)) (.cse7 (= ~c_dr_pc~0 (_ bv0 32))) (.cse8 (= ~local~0 ~token~0)) (.cse13 (= ~t1_st~0 (_ bv2 32))) (.cse14 (= ~t1_pc~0 (_ bv1 32))) (.cse9 (= (_ bv1 32) ~t1_i~0)) (.cse11 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse8 .cse14 .cse9 .cse11) (and .cse0 .cse3 .cse4 .cse6 .cse7 .cse12 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse9 .cse10 .cse11) (and .cse0 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse7 .cse13 .cse14 .cse9 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse9 .cse11))) [2023-12-22 02:40:12,735 INFO L895 garLoopResultBuilder]: At program point L1019-1(line 1019) the Hoare annotation is: (let ((.cse1 (= ~t1_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~m_st~0)) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv0 32) ~m_st~0)) (.cse3 (= (_ bv2 32) ~T1_E~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~E_1~0)) (.cse6 (= (_ bv0 32) ~m_pc~0)) (.cse7 (= ~c_dr_pc~0 (_ bv0 32))) (.cse8 (= ~local~0 ~token~0)) (.cse13 (= ~t1_st~0 (_ bv2 32))) (.cse14 (= ~t1_pc~0 (_ bv1 32))) (.cse9 (= (_ bv1 32) ~t1_i~0)) (.cse11 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse8 .cse14 .cse9 .cse11) (and .cse0 .cse3 .cse4 .cse6 .cse7 .cse12 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse9 .cse10 .cse11) (and .cse0 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse7 .cse13 .cse14 .cse9 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse9 .cse11))) [2023-12-22 02:40:12,735 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 631) no Hoare annotation was computed. [2023-12-22 02:40:12,735 INFO L895 garLoopResultBuilder]: At program point L1020(line 1020) the Hoare annotation is: (let ((.cse1 (= ~t1_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~m_st~0)) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv0 32) ~m_st~0)) (.cse3 (= (_ bv2 32) ~T1_E~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~E_1~0)) (.cse6 (= (_ bv0 32) ~m_pc~0)) (.cse7 (= ~c_dr_pc~0 (_ bv0 32))) (.cse8 (= ~local~0 ~token~0)) (.cse13 (= ~t1_st~0 (_ bv2 32))) (.cse14 (= ~t1_pc~0 (_ bv1 32))) (.cse9 (= (_ bv1 32) ~t1_i~0)) (.cse11 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse8 .cse14 .cse9 .cse11) (and .cse0 .cse3 .cse4 .cse6 .cse7 .cse12 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse9 .cse10 .cse11) (and .cse0 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse7 .cse13 .cse14 .cse9 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse9 .cse11))) [2023-12-22 02:40:12,735 INFO L899 garLoopResultBuilder]: For program point L954-1(lines 935 962) no Hoare annotation was computed. [2023-12-22 02:40:12,735 INFO L895 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) (= ~p_dw_i~0 (_ bv1 32)) (= (_ bv2 32) ~slow_clk_edge~0) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= (_ bv0 32) ~m_st~0) (= ~fast_clk_edge~0 (_ bv2 32)) (= (_ bv2 32) ~T1_E~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-22 02:40:12,735 INFO L899 garLoopResultBuilder]: For program point L492-1(line 492) no Hoare annotation was computed. [2023-12-22 02:40:12,735 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-22 02:40:12,736 INFO L895 garLoopResultBuilder]: At program point L1021(line 1021) the Hoare annotation is: (let ((.cse1 (= ~t1_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~m_st~0)) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv0 32) ~m_st~0)) (.cse3 (= (_ bv2 32) ~T1_E~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~E_1~0)) (.cse6 (= (_ bv0 32) ~m_pc~0)) (.cse7 (= ~c_dr_pc~0 (_ bv0 32))) (.cse8 (= ~local~0 ~token~0)) (.cse13 (= ~t1_st~0 (_ bv2 32))) (.cse14 (= ~t1_pc~0 (_ bv1 32))) (.cse9 (= (_ bv1 32) ~t1_i~0)) (.cse11 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse8 .cse14 .cse9 .cse11) (and .cse0 .cse3 .cse4 .cse6 .cse7 .cse12 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse9 .cse10 .cse11) (and .cse0 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse7 .cse13 .cse14 .cse9 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse9 .cse11))) [2023-12-22 02:40:12,736 INFO L899 garLoopResultBuilder]: For program point L988(lines 977 990) no Hoare annotation was computed. [2023-12-22 02:40:12,736 INFO L895 garLoopResultBuilder]: At program point L790(line 790) the Hoare annotation is: (let ((.cse1 (= ~t1_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~m_st~0)) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv0 32) ~m_st~0)) (.cse3 (= (_ bv2 32) ~T1_E~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~E_1~0)) (.cse6 (= (_ bv0 32) ~m_pc~0)) (.cse7 (= ~c_dr_pc~0 (_ bv0 32))) (.cse8 (= ~local~0 ~token~0)) (.cse13 (= ~t1_st~0 (_ bv2 32))) (.cse14 (= ~t1_pc~0 (_ bv1 32))) (.cse9 (= (_ bv1 32) ~t1_i~0)) (.cse11 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse8 .cse14 .cse9 .cse11) (and .cse0 .cse3 .cse4 .cse6 .cse7 .cse12 .cse9 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse12 .cse9 .cse10 .cse11) (and .cse0 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse7 .cse13 .cse14 .cse9 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse9 .cse11))) [2023-12-22 02:40:12,736 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2023-12-22 02:40:12,736 INFO L899 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2023-12-22 02:40:12,736 INFO L895 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (let ((.cse0 (= (_ bv2 32) ~E_M~0)) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse3 (= (_ bv0 32) ~m_pc~0)) (.cse4 (= ~c_dr_pc~0 (_ bv0 32))) (.cse5 (= ~t1_pc~0 (_ bv0 32))) (.cse6 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ~c_dr_st~0) .cse5 .cse6) (and .cse0 (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) (= ~p_dw_i~0 (_ bv1 32)) (= (_ bv2 32) ~slow_clk_edge~0) (= ~t1_st~0 (_ bv0 32)) .cse1 (= (_ bv0 32) ~m_st~0) (= ~fast_clk_edge~0 (_ bv2 32)) .cse2 (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv2 32) ~E_1~0) .cse3 .cse4 (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) .cse5 (= ~c_dr_st~0 (_ bv0 32)) .cse6))) [2023-12-22 02:40:12,736 INFO L895 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (let ((.cse0 (= (_ bv2 32) ~E_M~0)) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse3 (= (_ bv0 32) ~m_pc~0)) (.cse4 (= ~c_dr_pc~0 (_ bv0 32))) (.cse5 (= ~t1_pc~0 (_ bv0 32))) (.cse6 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ~c_dr_st~0) .cse5 .cse6) (and .cse0 (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) (= ~p_dw_i~0 (_ bv1 32)) (= (_ bv2 32) ~slow_clk_edge~0) (= ~t1_st~0 (_ bv0 32)) .cse1 (= (_ bv0 32) ~m_st~0) (= ~fast_clk_edge~0 (_ bv2 32)) .cse2 (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv2 32) ~E_1~0) .cse3 .cse4 (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) .cse5 (= ~c_dr_st~0 (_ bv0 32)) .cse6))) [2023-12-22 02:40:12,736 INFO L899 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2023-12-22 02:40:12,736 INFO L899 garLoopResultBuilder]: For program point L792(line 792) no Hoare annotation was computed. [2023-12-22 02:40:12,736 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2023-12-22 02:40:12,736 INFO L895 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (let ((.cse0 (= (_ bv2 32) ~E_M~0)) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse3 (= (_ bv0 32) ~m_pc~0)) (.cse4 (= ~c_dr_pc~0 (_ bv0 32))) (.cse5 (= ~t1_pc~0 (_ bv0 32))) (.cse6 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ~c_dr_st~0) .cse5 .cse6) (and .cse0 (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) (= ~p_dw_i~0 (_ bv1 32)) (= (_ bv2 32) ~slow_clk_edge~0) (= ~t1_st~0 (_ bv0 32)) .cse1 (= (_ bv0 32) ~m_st~0) (= ~fast_clk_edge~0 (_ bv2 32)) .cse2 (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv2 32) ~E_1~0) .cse3 .cse4 (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) .cse5 (= ~c_dr_st~0 (_ bv0 32)) .cse6))) [2023-12-22 02:40:12,736 INFO L899 garLoopResultBuilder]: For program point L1024(line 1024) no Hoare annotation was computed. [2023-12-22 02:40:12,736 INFO L899 garLoopResultBuilder]: For program point $Ultimate##115(lines 648 654) no Hoare annotation was computed. [2023-12-22 02:40:12,736 INFO L899 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2023-12-22 02:40:12,736 INFO L899 garLoopResultBuilder]: For program point L794-1(lines 789 827) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1026 1035) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point L95(lines 73 97) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 70 98) the Hoare annotation is: true [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point L311(lines 298 313) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 308) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 309) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 295 314) the Hoare annotation is: true [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point L767(lines 767 777) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point L779(lines 766 781) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 763 782) the Hoare annotation is: true [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point L771(lines 771 776) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 763 782) no Hoare annotation was computed. [2023-12-22 02:40:12,737 INFO L899 garLoopResultBuilder]: For program point L337-1(lines 336 349) no Hoare annotation was computed. [2023-12-22 02:40:12,738 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 333 350) the Hoare annotation is: (let ((.cse24 (= (_ bv2 32) ~q_read_ev~0)) (.cse22 (= |old(~q_write_ev~0)| ~q_write_ev~0))) (let ((.cse23 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse6 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse19 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse20 (and .cse24 .cse22)) (.cse18 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse0 (not (= (_ bv2 32) ~M_E~0))) (.cse2 (not (= (_ bv2 32) ~c_dr_st~0))) (.cse3 (not (= (_ bv0 32) ~m_st~0))) (.cse4 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse5 (not (= |old(~q_write_ev~0)| (_ bv2 32)))) (.cse7 (not (= (_ bv2 32) ~T1_E~0))) (.cse8 (not (= ~local~0 ~token~0))) (.cse9 (not (= (_ bv0 32) ~m_pc~0))) (.cse10 (not (= (_ bv2 32) |old(~q_read_ev~0)|))) (.cse11 (not (= ~q_free~0 (_ bv0 32)))) (.cse12 (and (= (_ bv2 32) ~q_write_ev~0) .cse24)) (.cse13 (not (= ~t1_st~0 (_ bv0 32)))) (.cse14 (not (= (_ bv2 32) ~E_1~0))) (.cse15 (not (= ~p_dw_i~0 (_ bv1 32)))) (.cse16 (not (= (_ bv2 32) ~E_M~0))) (.cse17 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse21 (not (= ~p_dw_st~0 (_ bv2 32))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse3 .cse4 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21) (or .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse3 .cse4 .cse5 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21) (or .cse0 .cse2 .cse7 .cse9 (and .cse22 (= |old(~q_read_ev~0)| ~q_read_ev~0)) .cse16 .cse23 .cse17) (or .cse18 .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse19 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21) (or .cse18 .cse0 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21) (or .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 (not (= ~p_dw_pc~0 (_ bv0 32))) .cse3 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23 (not (= ~fast_clk_edge~0 (_ bv2 32))) .cse17 (not (= (_ bv2 32) ~slow_clk_edge~0))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21)))) [2023-12-22 02:40:12,738 INFO L899 garLoopResultBuilder]: For program point L342-1(lines 333 350) no Hoare annotation was computed. [2023-12-22 02:40:12,738 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2023-12-22 02:40:12,738 INFO L899 garLoopResultBuilder]: For program point L866-1(lines 865 888) no Hoare annotation was computed. [2023-12-22 02:40:12,738 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 862 889) no Hoare annotation was computed. [2023-12-22 02:40:12,738 INFO L899 garLoopResultBuilder]: For program point L881-1(lines 862 889) no Hoare annotation was computed. [2023-12-22 02:40:12,738 INFO L899 garLoopResultBuilder]: For program point L876-1(lines 865 888) no Hoare annotation was computed. [2023-12-22 02:40:12,738 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 862 889) the Hoare annotation is: (let ((.cse13 (= (_ bv2 32) ~E_M~0)) (.cse14 (= (_ bv2 32) ~T1_E~0)) (.cse15 (= |old(~M_E~0)| ~M_E~0))) (let ((.cse4 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse17 (not (= ~t1_st~0 (_ bv2 32)))) (.cse16 (not (= (_ bv0 32) ~m_st~0))) (.cse6 (not (= ~local~0 ~token~0))) (.cse12 (not (= (_ bv0 32) ~m_pc~0))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not (= (_ bv2 32) |old(~E_M~0)|))) (.cse2 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse3 (not (= (_ bv2 32) |old(~E_1~0)|))) (.cse5 (not (= (_ bv1 32) ~t1_i~0))) (.cse7 (not (= ~t1_st~0 (_ bv0 32)))) (.cse8 (not (= (_ bv2 32) |old(~T1_E~0)|))) (.cse9 (and .cse13 .cse14 .cse15 (= (_ bv2 32) ~E_1~0))) (.cse10 (not (= (_ bv2 32) ~m_st~0))) (.cse11 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse18 (not (= ~t1_pc~0 (_ bv0 32))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse5 .cse12 .cse8 .cse10 .cse11 (and .cse13 .cse14 .cse15)) (or .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse8 .cse9 .cse17 .cse11) (or .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse17 .cse11 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse8 .cse9 .cse17 .cse10 .cse11) (or .cse0 .cse16 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9 .cse11 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18)))) [2023-12-22 02:40:12,738 INFO L899 garLoopResultBuilder]: For program point L871-1(lines 865 888) no Hoare annotation was computed. [2023-12-22 02:40:12,741 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:40:12,742 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 02:40:12,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 02:40:12 BoogieIcfgContainer [2023-12-22 02:40:12,775 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 02:40:12,775 INFO L158 Benchmark]: Toolchain (without parser) took 77428.77ms. Allocated memory was 265.3MB in the beginning and 4.2GB in the end (delta: 3.9GB). Free memory was 214.0MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2023-12-22 02:40:12,776 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 211.8MB. Free memory is still 163.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 02:40:12,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.44ms. Allocated memory is still 265.3MB. Free memory was 213.8MB in the beginning and 195.2MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-22 02:40:12,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.94ms. Allocated memory is still 265.3MB. Free memory was 195.2MB in the beginning and 192.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-22 02:40:12,776 INFO L158 Benchmark]: Boogie Preprocessor took 59.66ms. Allocated memory is still 265.3MB. Free memory was 192.4MB in the beginning and 188.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-22 02:40:12,776 INFO L158 Benchmark]: RCFGBuilder took 530.08ms. Allocated memory is still 265.3MB. Free memory was 188.7MB in the beginning and 200.4MB in the end (delta: -11.8MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2023-12-22 02:40:12,776 INFO L158 Benchmark]: TraceAbstraction took 76474.10ms. Allocated memory was 265.3MB in the beginning and 4.2GB in the end (delta: 3.9GB). Free memory was 199.9MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2023-12-22 02:40:12,777 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.12ms. Allocated memory is still 211.8MB. Free memory is still 163.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 313.44ms. Allocated memory is still 265.3MB. Free memory was 213.8MB in the beginning and 195.2MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.94ms. Allocated memory is still 265.3MB. Free memory was 195.2MB in the beginning and 192.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.66ms. Allocated memory is still 265.3MB. Free memory was 192.4MB in the beginning and 188.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 530.08ms. Allocated memory is still 265.3MB. Free memory was 188.7MB in the beginning and 200.4MB in the end (delta: -11.8MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * TraceAbstraction took 76474.10ms. Allocated memory was 265.3MB in the beginning and 4.2GB in the end (delta: 3.9GB). Free memory was 199.9MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.8GB. 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: 599]: 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 15 procedures, 199 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 76.4s, OverallIterations: 33, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 31.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5802 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5646 mSDsluCounter, 15344 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8383 mSDsCounter, 533 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4354 IncrementalHoareTripleChecker+Invalid, 4887 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 533 mSolverCounterUnsat, 6961 mSDtfsCounter, 4354 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3352 GetRequests, 3275 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31185occurred in iteration=31, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 809 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 21726 PreInvPairs, 22926 NumberOfFragments, 15585 HoareAnnotationTreeSize, 21726 FormulaSimplifications, 2898 FormulaSimplificationTreeSizeReduction, 6.6s HoareSimplificationTime, 52 FormulaSimplificationsInter, 124334 FormulaSimplificationTreeSizeReductionInter, 24.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 3242 NumberOfCodeBlocks, 3137 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 3332 ConstructedInterpolants, 0 QuantifiedInterpolants, 5076 SizeOfPredicates, 7 NumberOfNonLiveVariables, 6750 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 34 InterpolantComputations, 33 PerfectInterpolantSequences, 1569/1583 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: 499]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 == E_M) && (2 == M_E)) && (2 == T1_E)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == c_dr_st)) && (t1_pc == 0)) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 2)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || ((((((((((((((((2 == E_M) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 2)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) || ((((((((((((((((2 == E_M) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 2)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || ((((((((((((((((2 == E_M) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 2)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 2)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((((2 == E_M) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == slow_clk_edge)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (fast_clk_edge == 2)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((2 == E_M) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 2)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((((((2 == E_M) && (2 == M_E)) && (2 == T1_E)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == c_dr_st)) && (t1_pc == 0)) || (((((((((((((((2 == E_M) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((2 == E_M) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((2 == E_M) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == slow_clk_edge)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (fast_clk_edge == 2)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((2 == E_M) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == slow_clk_edge)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (fast_clk_edge == 2)) && (2 == T1_E)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: (((((((((((((2 == E_M) && (2 == T1_E)) && (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)) && (p_dw_pc == 0)) || ((((((((((2 == E_M) && (t1_st == 0)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (1 == t1_i)) && (t1_pc == 0)) && (p_dw_pc == 0))) || ((((((((((2 == E_M) && (((local + 1) % 4294967296) == token)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (p_dw_pc == 0))) - InvariantResult [Line: 1007]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 == E_M) && (t1_st == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (1 == t1_i)) && (t1_pc == 0)) && (p_dw_pc == 0)) || (((((((((2 == E_M) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (1 == t1_i)) && (p_dw_pc == 0))) || (((((((((((2 == E_M) && (t1_st == 0)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (local == token)) && (t1_pc == 1)) && (1 == t1_i)) && (p_dw_pc == 0))) || ((((((((2 == E_M) && (2 == T1_E)) && (p_dw_st == 0)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == m_st)) && (1 == t1_i)) && (p_dw_pc == 0))) || ((((((((((2 == E_M) && (t1_st == 0)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (1 == t1_i)) && (t1_pc == 0)) && (p_dw_pc == 0))) || (((((((((((2 == E_M) && (((local + 1) % 4294967296) == token)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (p_dw_pc == 0))) || ((((((((((((2 == E_M) && (0 == m_st)) && (2 == T1_E)) && (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)) && (p_dw_pc == 0))) - InvariantResult [Line: 789]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 == E_M) && (t1_st == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (1 == t1_i)) && (t1_pc == 0)) && (p_dw_pc == 0)) || (((((((((2 == E_M) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (1 == t1_i)) && (p_dw_pc == 0))) || (((((((((((2 == E_M) && (t1_st == 0)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (local == token)) && (t1_pc == 1)) && (1 == t1_i)) && (p_dw_pc == 0))) || ((((((((2 == E_M) && (2 == T1_E)) && (p_dw_st == 0)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == m_st)) && (1 == t1_i)) && (p_dw_pc == 0))) || ((((((((((2 == E_M) && (t1_st == 0)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (1 == t1_i)) && (t1_pc == 0)) && (p_dw_pc == 0))) || (((((((((((2 == E_M) && (((local + 1) % 4294967296) == token)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (p_dw_pc == 0))) || ((((((((((((2 == E_M) && (0 == m_st)) && (2 == T1_E)) && (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)) && (p_dw_pc == 0))) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 == E_M) && (2 == M_E)) && (2 == T1_E)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == c_dr_st)) && (t1_pc == 0)) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 2)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || ((((((((((((((((2 == E_M) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 2)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) || ((((((((((((((((2 == E_M) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 2)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || ((((((((((((((((2 == E_M) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 2)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == slow_clk_edge)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (fast_clk_edge == 2)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((((2 == E_M) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == slow_clk_edge)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (fast_clk_edge == 2)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0)) && (p_dw_pc == 0))) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 2)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((((2 == E_M) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == slow_clk_edge)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (fast_clk_edge == 2)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((2 == E_M) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 2)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) - InvariantResult [Line: 678]: Loop Invariant Derived loop invariant: (((((((((((2 == E_M) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (1 == t1_i)) && (p_dw_pc == 0)) || ((((((((((2 == E_M) && (((local + 1) % 4294967296) == token)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_pc == 1)) && (1 == t1_i)) && (p_dw_pc == 0))) || ((((((((((2 == E_M) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (1 == t1_i)) && (p_dw_pc == 0))) || ((((((((2 == E_M) && (2 == T1_E)) && (p_dw_st == 0)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == m_st)) && (1 == t1_i)) && (p_dw_pc == 0))) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) || (((((((((((((((2 == E_M) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 2)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (t1_pc == 0))) || ((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 2)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0))) || (((((((((((((((((2 == E_M) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == slow_clk_edge)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (fast_clk_edge == 2)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) && (p_dw_pc == 0))) || (((((((((((((((2 == E_M) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 2)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0))) || ((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0))) || ((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_dw_st == 0)) && (c_dr_pc == 1)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (t1_pc == 0))) || (((((((((((((((((p_dw_pc == 1) && (2 == E_M)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == slow_clk_edge)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (fast_clk_edge == 2)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-22 02:40:12,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...