/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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-43.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 16:34:25,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 16:34:25,700 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-24 16:34:25,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 16:34:25,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 16:34:25,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 16:34:25,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 16:34:25,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 16:34:25,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 16:34:25,726 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 16:34:25,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 16:34:25,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 16:34:25,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 16:34:25,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 16:34:25,728 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 16:34:25,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 16:34:25,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 16:34:25,729 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 16:34:25,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 16:34:25,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 16:34:25,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 16:34:25,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 16:34:25,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 16:34:25,731 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 16:34:25,732 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 16:34:25,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 16:34:25,732 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 16:34:25,733 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 16:34:25,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 16:34:25,733 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 16:34:25,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 16:34:25,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 16:34:25,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 16:34:25,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 16:34:25,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 16:34:25,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 16:34:25,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 16:34:25,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 16:34:25,736 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 16:34:25,736 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 16:34:25,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 16:34:25,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 16:34:25,737 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 16:34:25,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 16:34:25,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 16:34:25,738 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 16:34:25,738 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-24 16:34:25,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 16:34:26,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 16:34:26,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 16:34:26,015 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 16:34:26,028 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 16:34:26,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-43.i [2023-12-24 16:34:27,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 16:34:27,364 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 16:34:27,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-43.i [2023-12-24 16:34:27,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb440c34d/e8491484da7b419bb6c5d4d370751fd2/FLAGd2003dd90 [2023-12-24 16:34:27,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb440c34d/e8491484da7b419bb6c5d4d370751fd2 [2023-12-24 16:34:27,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 16:34:27,396 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 16:34:27,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 16:34:27,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 16:34:27,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 16:34:27,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 04:34:27" (1/1) ... [2023-12-24 16:34:27,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc87276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:34:27, skipping insertion in model container [2023-12-24 16:34:27,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 04:34:27" (1/1) ... [2023-12-24 16:34:27,443 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 16:34:27,564 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-43.i[916,929] [2023-12-24 16:34:27,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 16:34:27,627 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 16:34:27,635 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-43.i[916,929] [2023-12-24 16:34:27,667 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 16:34:27,690 INFO L206 MainTranslator]: Completed translation [2023-12-24 16:34:27,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:34:27 WrapperNode [2023-12-24 16:34:27,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 16:34:27,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 16:34:27,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 16:34:27,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 16:34:27,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:34:27" (1/1) ... [2023-12-24 16:34:27,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:34:27" (1/1) ... [2023-12-24 16:34:27,765 INFO L138 Inliner]: procedures = 33, calls = 193, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 551 [2023-12-24 16:34:27,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 16:34:27,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 16:34:27,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 16:34:27,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 16:34:27,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:34:27" (1/1) ... [2023-12-24 16:34:27,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:34:27" (1/1) ... [2023-12-24 16:34:27,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:34:27" (1/1) ... [2023-12-24 16:34:27,809 INFO L175 MemorySlicer]: Split 144 memory accesses to 19 slices as follows [2, 9, 8, 10, 10, 10, 10, 6, 6, 6, 15, 12, 3, 6, 3, 9, 6, 7, 6]. 10 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 21 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1]. [2023-12-24 16:34:27,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:34:27" (1/1) ... [2023-12-24 16:34:27,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:34:27" (1/1) ... [2023-12-24 16:34:27,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:34:27" (1/1) ... [2023-12-24 16:34:27,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:34:27" (1/1) ... [2023-12-24 16:34:27,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:34:27" (1/1) ... [2023-12-24 16:34:27,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:34:27" (1/1) ... [2023-12-24 16:34:27,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 16:34:27,861 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 16:34:27,861 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 16:34:27,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 16:34:27,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:34:27" (1/1) ... [2023-12-24 16:34:27,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 16:34:27,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 16:34:27,889 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-24 16:34:27,898 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-24 16:34:27,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 16:34:27,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 16:34:27,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 16:34:27,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 16:34:27,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 16:34:27,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 16:34:27,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-24 16:34:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-12-24 16:34:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-12-24 16:34:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2023-12-24 16:34:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2023-12-24 16:34:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2023-12-24 16:34:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2023-12-24 16:34:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2023-12-24 16:34:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2023-12-24 16:34:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2023-12-24 16:34:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2023-12-24 16:34:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2023-12-24 16:34:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#17 [2023-12-24 16:34:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#18 [2023-12-24 16:34:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 16:34:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 16:34:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-24 16:34:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-24 16:34:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-24 16:34:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-12-24 16:34:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2023-12-24 16:34:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2023-12-24 16:34:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2023-12-24 16:34:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2023-12-24 16:34:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2023-12-24 16:34:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2023-12-24 16:34:27,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2023-12-24 16:34:27,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2023-12-24 16:34:27,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2023-12-24 16:34:27,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2023-12-24 16:34:27,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#16 [2023-12-24 16:34:27,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#17 [2023-12-24 16:34:27,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#18 [2023-12-24 16:34:27,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 16:34:27,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 16:34:27,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 16:34:27,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 16:34:27,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 16:34:27,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-24 16:34:27,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-12-24 16:34:27,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-12-24 16:34:27,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2023-12-24 16:34:27,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2023-12-24 16:34:27,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2023-12-24 16:34:27,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2023-12-24 16:34:27,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2023-12-24 16:34:27,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2023-12-24 16:34:27,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2023-12-24 16:34:27,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2023-12-24 16:34:27,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2023-12-24 16:34:27,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#17 [2023-12-24 16:34:27,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#18 [2023-12-24 16:34:27,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-12-24 16:34:27,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-12-24 16:34:27,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2023-12-24 16:34:27,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2023-12-24 16:34:27,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2023-12-24 16:34:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2023-12-24 16:34:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2023-12-24 16:34:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2023-12-24 16:34:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2023-12-24 16:34:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2023-12-24 16:34:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2023-12-24 16:34:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2023-12-24 16:34:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2023-12-24 16:34:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2023-12-24 16:34:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2023-12-24 16:34:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2023-12-24 16:34:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#16 [2023-12-24 16:34:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#17 [2023-12-24 16:34:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#18 [2023-12-24 16:34:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 16:34:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 16:34:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-24 16:34:27,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-24 16:34:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-24 16:34:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-12-24 16:34:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2023-12-24 16:34:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2023-12-24 16:34:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2023-12-24 16:34:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2023-12-24 16:34:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2023-12-24 16:34:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2023-12-24 16:34:27,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2023-12-24 16:34:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2023-12-24 16:34:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2023-12-24 16:34:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2023-12-24 16:34:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#16 [2023-12-24 16:34:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#17 [2023-12-24 16:34:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#18 [2023-12-24 16:34:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-12-24 16:34:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-12-24 16:34:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2023-12-24 16:34:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2023-12-24 16:34:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2023-12-24 16:34:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2023-12-24 16:34:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2023-12-24 16:34:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2023-12-24 16:34:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2023-12-24 16:34:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2023-12-24 16:34:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2023-12-24 16:34:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2023-12-24 16:34:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2023-12-24 16:34:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2023-12-24 16:34:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2023-12-24 16:34:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2023-12-24 16:34:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#16 [2023-12-24 16:34:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#17 [2023-12-24 16:34:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#18 [2023-12-24 16:34:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-12-24 16:34:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-12-24 16:34:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2023-12-24 16:34:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2023-12-24 16:34:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2023-12-24 16:34:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2023-12-24 16:34:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2023-12-24 16:34:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2023-12-24 16:34:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2023-12-24 16:34:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2023-12-24 16:34:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2023-12-24 16:34:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2023-12-24 16:34:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2023-12-24 16:34:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2023-12-24 16:34:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2023-12-24 16:34:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2023-12-24 16:34:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#16 [2023-12-24 16:34:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#17 [2023-12-24 16:34:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#18 [2023-12-24 16:34:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 16:34:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 16:34:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 16:34:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 16:34:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 16:34:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 16:34:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 16:34:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 16:34:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 16:34:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-24 16:34:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-12-24 16:34:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-12-24 16:34:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2023-12-24 16:34:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2023-12-24 16:34:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2023-12-24 16:34:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2023-12-24 16:34:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2023-12-24 16:34:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2023-12-24 16:34:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2023-12-24 16:34:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2023-12-24 16:34:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2023-12-24 16:34:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#17 [2023-12-24 16:34:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#18 [2023-12-24 16:34:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 16:34:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 16:34:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-24 16:34:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-24 16:34:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-24 16:34:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-12-24 16:34:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2023-12-24 16:34:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2023-12-24 16:34:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2023-12-24 16:34:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2023-12-24 16:34:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2023-12-24 16:34:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2023-12-24 16:34:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2023-12-24 16:34:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2023-12-24 16:34:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2023-12-24 16:34:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2023-12-24 16:34:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#16 [2023-12-24 16:34:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#17 [2023-12-24 16:34:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#18 [2023-12-24 16:34:28,192 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 16:34:28,194 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 16:34:29,141 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 16:34:29,206 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 16:34:29,206 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 16:34:29,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 04:34:29 BoogieIcfgContainer [2023-12-24 16:34:29,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 16:34:29,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 16:34:29,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 16:34:29,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 16:34:29,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 04:34:27" (1/3) ... [2023-12-24 16:34:29,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b425155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 04:34:29, skipping insertion in model container [2023-12-24 16:34:29,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:34:27" (2/3) ... [2023-12-24 16:34:29,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b425155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 04:34:29, skipping insertion in model container [2023-12-24 16:34:29,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 04:34:29" (3/3) ... [2023-12-24 16:34:29,215 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-43.i [2023-12-24 16:34:29,231 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 16:34:29,231 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 16:34:29,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 16:34:29,289 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;@2264e11c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 16:34:29,289 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 16:34:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 83 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 16:34:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-24 16:34:29,318 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:34:29,319 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:34:29,319 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:34:29,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:34:29,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2138554643, now seen corresponding path program 1 times [2023-12-24 16:34:29,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:34:29,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956493249] [2023-12-24 16:34:29,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:34:29,342 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-24 16:34:29,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:34:29,345 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-24 16:34:29,356 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-24 16:34:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:34:29,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 16:34:29,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:34:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2023-12-24 16:34:30,007 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:34:30,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:34:30,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956493249] [2023-12-24 16:34:30,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956493249] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:34:30,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:34:30,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 16:34:30,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369579032] [2023-12-24 16:34:30,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:34:30,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 16:34:30,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:34:30,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 16:34:30,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 16:34:30,039 INFO L87 Difference]: Start difference. First operand has 105 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 83 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 16:34:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:34:30,121 INFO L93 Difference]: Finished difference Result 207 states and 334 transitions. [2023-12-24 16:34:30,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 16:34:30,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2023-12-24 16:34:30,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:34:30,130 INFO L225 Difference]: With dead ends: 207 [2023-12-24 16:34:30,130 INFO L226 Difference]: Without dead ends: 103 [2023-12-24 16:34:30,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 16:34:30,136 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:34:30,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:34:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-24 16:34:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-24 16:34:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 81 states have internal predecessors, (113), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 16:34:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 153 transitions. [2023-12-24 16:34:30,177 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 153 transitions. Word has length 159 [2023-12-24 16:34:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:34:30,177 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 153 transitions. [2023-12-24 16:34:30,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 16:34:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 153 transitions. [2023-12-24 16:34:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-24 16:34:30,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:34:30,181 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:34:30,204 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-24 16:34:30,395 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-24 16:34:30,395 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:34:30,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:34:30,396 INFO L85 PathProgramCache]: Analyzing trace with hash 45633421, now seen corresponding path program 1 times [2023-12-24 16:34:30,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:34:30,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214997332] [2023-12-24 16:34:30,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:34:30,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-24 16:34:30,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:34:30,399 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-24 16:34:30,428 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-24 16:34:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:34:30,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:34:31,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:34:31,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-24 16:34:31,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 16:34:31,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-24 16:34:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-24 16:34:32,025 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:34:32,253 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 16:34:32,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-12-24 16:34:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-24 16:34:32,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:34:32,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214997332] [2023-12-24 16:34:32,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214997332] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:34:32,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:34:32,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2023-12-24 16:34:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619892992] [2023-12-24 16:34:32,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:34:32,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 16:34:32,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:34:32,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 16:34:32,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-24 16:34:32,530 INFO L87 Difference]: Start difference. First operand 103 states and 153 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 16:34:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:34:32,999 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2023-12-24 16:34:33,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 16:34:33,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2023-12-24 16:34:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:34:33,007 INFO L225 Difference]: With dead ends: 211 [2023-12-24 16:34:33,007 INFO L226 Difference]: Without dead ends: 109 [2023-12-24 16:34:33,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-12-24 16:34:33,009 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 626 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:34:33,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 276 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 16:34:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-24 16:34:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2023-12-24 16:34:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 16:34:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2023-12-24 16:34:33,026 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 159 [2023-12-24 16:34:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:34:33,026 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2023-12-24 16:34:33,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 16:34:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2023-12-24 16:34:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-24 16:34:33,029 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:34:33,029 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:34:33,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 16:34:33,243 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-24 16:34:33,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:34:33,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:34:33,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1643310321, now seen corresponding path program 1 times [2023-12-24 16:34:33,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:34:33,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927408171] [2023-12-24 16:34:33,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:34:33,246 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-24 16:34:33,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:34:33,247 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-24 16:34:33,249 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-24 16:34:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:34:33,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:34:33,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:34:34,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-24 16:34:34,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 16:34:34,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-24 16:34:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-24 16:34:34,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:34:34,659 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 16:34:34,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-12-24 16:34:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-24 16:34:34,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:34:34,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927408171] [2023-12-24 16:34:34,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927408171] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:34:34,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:34:34,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2023-12-24 16:34:34,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344474824] [2023-12-24 16:34:34,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:34:34,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 16:34:34,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:34:34,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 16:34:34,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-24 16:34:34,937 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 16:34:35,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:34:35,330 INFO L93 Difference]: Finished difference Result 232 states and 336 transitions. [2023-12-24 16:34:35,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 16:34:35,330 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2023-12-24 16:34:35,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:34:35,332 INFO L225 Difference]: With dead ends: 232 [2023-12-24 16:34:35,332 INFO L226 Difference]: Without dead ends: 126 [2023-12-24 16:34:35,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-12-24 16:34:35,334 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 399 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:34:35,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 275 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:34:35,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-24 16:34:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2023-12-24 16:34:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 16:34:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2023-12-24 16:34:35,353 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 159 [2023-12-24 16:34:35,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:34:35,354 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2023-12-24 16:34:35,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 16:34:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2023-12-24 16:34:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-24 16:34:35,356 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:34:35,356 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:34:35,377 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-24 16:34:35,570 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-24 16:34:35,571 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:34:35,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:34:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1371793297, now seen corresponding path program 1 times [2023-12-24 16:34:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:34:35,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912075253] [2023-12-24 16:34:35,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:34:35,573 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-24 16:34:35,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:34:35,574 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-24 16:34:35,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 16:34:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:34:36,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 16:34:36,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:34:36,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-12-24 16:34:36,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2023-12-24 16:34:36,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2023-12-24 16:34:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:34:36,469 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:34:36,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:34:36,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912075253] [2023-12-24 16:34:36,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912075253] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:34:36,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:34:36,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 16:34:36,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837124504] [2023-12-24 16:34:36,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:34:36,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 16:34:36,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:34:36,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 16:34:36,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:34:36,472 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:34:37,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:34:37,154 INFO L93 Difference]: Finished difference Result 442 states and 638 transitions. [2023-12-24 16:34:37,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 16:34:37,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2023-12-24 16:34:37,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:34:37,161 INFO L225 Difference]: With dead ends: 442 [2023-12-24 16:34:37,161 INFO L226 Difference]: Without dead ends: 336 [2023-12-24 16:34:37,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-24 16:34:37,163 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 284 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 16:34:37,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1196 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 16:34:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-12-24 16:34:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 314. [2023-12-24 16:34:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 247 states have (on average 1.3562753036437247) internal successors, (335), 247 states have internal predecessors, (335), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:34:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 455 transitions. [2023-12-24 16:34:37,217 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 455 transitions. Word has length 159 [2023-12-24 16:34:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:34:37,218 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 455 transitions. [2023-12-24 16:34:37,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:34:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 455 transitions. [2023-12-24 16:34:37,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-24 16:34:37,220 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:34:37,220 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:34:37,237 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 (5)] Forceful destruction successful, exit code 0 [2023-12-24 16:34:37,434 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-24 16:34:37,435 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:34:37,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:34:37,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1771474088, now seen corresponding path program 1 times [2023-12-24 16:34:37,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:34:37,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948838558] [2023-12-24 16:34:37,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:34:37,436 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-24 16:34:37,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:34:37,438 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-24 16:34:37,460 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-24 16:34:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:34:37,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:34:37,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:34:38,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-24 16:34:38,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 16:34:38,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-24 16:34:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-24 16:34:38,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:34:38,901 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 16:34:38,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-12-24 16:34:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-24 16:34:39,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:34:39,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948838558] [2023-12-24 16:34:39,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948838558] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:34:39,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:34:39,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2023-12-24 16:34:39,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700599930] [2023-12-24 16:34:39,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:34:39,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 16:34:39,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:34:39,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 16:34:39,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-24 16:34:39,158 INFO L87 Difference]: Start difference. First operand 314 states and 455 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 16:34:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:34:39,550 INFO L93 Difference]: Finished difference Result 682 states and 987 transitions. [2023-12-24 16:34:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 16:34:39,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2023-12-24 16:34:39,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:34:39,570 INFO L225 Difference]: With dead ends: 682 [2023-12-24 16:34:39,570 INFO L226 Difference]: Without dead ends: 369 [2023-12-24 16:34:39,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-12-24 16:34:39,572 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 494 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:34:39,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 281 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:34:39,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-12-24 16:34:39,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 314. [2023-12-24 16:34:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 247 states have internal predecessors, (332), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:34:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 452 transitions. [2023-12-24 16:34:39,610 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 452 transitions. Word has length 159 [2023-12-24 16:34:39,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:34:39,611 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 452 transitions. [2023-12-24 16:34:39,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 16:34:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 452 transitions. [2023-12-24 16:34:39,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-24 16:34:39,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:34:39,612 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:34:39,629 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 (6)] Forceful destruction successful, exit code 0 [2023-12-24 16:34:39,826 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-24 16:34:39,827 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:34:39,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:34:39,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1243629530, now seen corresponding path program 1 times [2023-12-24 16:34:39,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:34:39,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304790616] [2023-12-24 16:34:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:34:39,828 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-24 16:34:39,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:34:39,830 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-24 16:34:39,837 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-24 16:34:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:34:40,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 16:34:40,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:34:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:34:40,374 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:34:40,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:34:40,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304790616] [2023-12-24 16:34:40,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304790616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:34:40,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:34:40,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:34:40,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510079090] [2023-12-24 16:34:40,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:34:40,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:34:40,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:34:40,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:34:40,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:34:40,376 INFO L87 Difference]: Start difference. First operand 314 states and 452 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:34:40,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:34:40,499 INFO L93 Difference]: Finished difference Result 676 states and 975 transitions. [2023-12-24 16:34:40,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:34:40,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2023-12-24 16:34:40,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:34:40,502 INFO L225 Difference]: With dead ends: 676 [2023-12-24 16:34:40,502 INFO L226 Difference]: Without dead ends: 363 [2023-12-24 16:34:40,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:34:40,503 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 52 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:34:40,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 598 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:34:40,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-12-24 16:34:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 316. [2023-12-24 16:34:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 249 states have (on average 1.3373493975903614) internal successors, (333), 249 states have internal predecessors, (333), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:34:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 453 transitions. [2023-12-24 16:34:40,528 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 453 transitions. Word has length 159 [2023-12-24 16:34:40,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:34:40,529 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 453 transitions. [2023-12-24 16:34:40,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:34:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 453 transitions. [2023-12-24 16:34:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-24 16:34:40,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:34:40,531 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:34:40,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 16:34:40,745 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-24 16:34:40,746 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:34:40,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:34:40,746 INFO L85 PathProgramCache]: Analyzing trace with hash 202203919, now seen corresponding path program 1 times [2023-12-24 16:34:40,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:34:40,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896922899] [2023-12-24 16:34:40,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:34:40,747 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-24 16:34:40,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:34:40,748 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-24 16:34:40,750 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-24 16:34:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:34:41,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:34:41,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:34:41,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-24 16:34:41,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 16:34:41,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-24 16:34:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-24 16:34:41,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:34:42,105 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 16:34:42,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-12-24 16:34:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-24 16:34:42,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:34:42,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896922899] [2023-12-24 16:34:42,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896922899] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:34:42,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:34:42,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2023-12-24 16:34:42,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038202755] [2023-12-24 16:34:42,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:34:42,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 16:34:42,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:34:42,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 16:34:42,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-24 16:34:42,385 INFO L87 Difference]: Start difference. First operand 316 states and 453 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 16:34:42,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:34:42,737 INFO L93 Difference]: Finished difference Result 637 states and 911 transitions. [2023-12-24 16:34:42,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 16:34:42,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2023-12-24 16:34:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:34:42,739 INFO L225 Difference]: With dead ends: 637 [2023-12-24 16:34:42,739 INFO L226 Difference]: Without dead ends: 322 [2023-12-24 16:34:42,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-12-24 16:34:42,741 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 400 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:34:42,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 272 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:34:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-12-24 16:34:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 316. [2023-12-24 16:34:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 249 states have (on average 1.3253012048192772) internal successors, (330), 249 states have internal predecessors, (330), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:34:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 450 transitions. [2023-12-24 16:34:42,788 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 450 transitions. Word has length 159 [2023-12-24 16:34:42,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:34:42,788 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 450 transitions. [2023-12-24 16:34:42,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 16:34:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 450 transitions. [2023-12-24 16:34:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-24 16:34:42,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:34:42,790 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:34:42,808 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-24 16:34:43,009 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-24 16:34:43,009 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:34:43,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:34:43,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1486739823, now seen corresponding path program 1 times [2023-12-24 16:34:43,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:34:43,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324270134] [2023-12-24 16:34:43,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:34:43,010 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-24 16:34:43,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:34:43,012 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-24 16:34:43,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 (9)] Waiting until timeout for monitored process [2023-12-24 16:34:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:34:43,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 16:34:43,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:34:44,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2023-12-24 16:34:44,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2023-12-24 16:34:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:34:44,179 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:34:44,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:34:44,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324270134] [2023-12-24 16:34:44,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324270134] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:34:44,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:34:44,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 16:34:44,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31511691] [2023-12-24 16:34:44,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:34:44,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 16:34:44,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:34:44,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 16:34:44,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-24 16:34:44,180 INFO L87 Difference]: Start difference. First operand 316 states and 450 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:34:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:34:44,648 INFO L93 Difference]: Finished difference Result 689 states and 980 transitions. [2023-12-24 16:34:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 16:34:44,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2023-12-24 16:34:44,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:34:44,653 INFO L225 Difference]: With dead ends: 689 [2023-12-24 16:34:44,653 INFO L226 Difference]: Without dead ends: 374 [2023-12-24 16:34:44,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-12-24 16:34:44,655 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 176 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:34:44,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1050 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 16:34:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-12-24 16:34:44,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 326. [2023-12-24 16:34:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 259 states have (on average 1.308880308880309) internal successors, (339), 259 states have internal predecessors, (339), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:34:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 459 transitions. [2023-12-24 16:34:44,680 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 459 transitions. Word has length 159 [2023-12-24 16:34:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:34:44,681 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 459 transitions. [2023-12-24 16:34:44,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:34:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 459 transitions. [2023-12-24 16:34:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-24 16:34:44,683 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:34:44,683 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:34:44,700 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-24 16:34:44,901 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-24 16:34:44,901 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:34:44,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:34:44,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1998880847, now seen corresponding path program 1 times [2023-12-24 16:34:44,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:34:44,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337602998] [2023-12-24 16:34:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:34:44,902 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-24 16:34:44,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:34:44,903 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-24 16:34:44,904 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-24 16:34:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:34:45,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 16:34:45,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:34:46,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2023-12-24 16:34:46,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2023-12-24 16:34:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:34:46,071 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:34:46,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:34:46,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337602998] [2023-12-24 16:34:46,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337602998] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:34:46,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:34:46,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 16:34:46,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713863953] [2023-12-24 16:34:46,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:34:46,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 16:34:46,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:34:46,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 16:34:46,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-24 16:34:46,073 INFO L87 Difference]: Start difference. First operand 326 states and 459 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:34:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:34:46,766 INFO L93 Difference]: Finished difference Result 708 states and 993 transitions. [2023-12-24 16:34:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-24 16:34:46,769 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2023-12-24 16:34:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:34:46,771 INFO L225 Difference]: With dead ends: 708 [2023-12-24 16:34:46,772 INFO L226 Difference]: Without dead ends: 383 [2023-12-24 16:34:46,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2023-12-24 16:34:46,773 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 175 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 16:34:46,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1184 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 16:34:46,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2023-12-24 16:34:46,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 332. [2023-12-24 16:34:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 265 states have (on average 1.3018867924528301) internal successors, (345), 265 states have internal predecessors, (345), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:34:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 465 transitions. [2023-12-24 16:34:46,797 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 465 transitions. Word has length 159 [2023-12-24 16:34:46,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:34:46,797 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 465 transitions. [2023-12-24 16:34:46,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:34:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 465 transitions. [2023-12-24 16:34:46,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-24 16:34:46,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:34:46,799 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:34:46,816 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-24 16:34:47,013 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-24 16:34:47,013 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:34:47,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:34:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2056139149, now seen corresponding path program 1 times [2023-12-24 16:34:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:34:47,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59352347] [2023-12-24 16:34:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:34:47,015 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-24 16:34:47,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:34:47,016 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-24 16:34:47,021 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-24 16:34:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:34:47,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-24 16:34:47,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:34:49,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 62 [2023-12-24 16:34:49,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 38 [2023-12-24 16:34:49,942 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-24 16:34:49,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:34:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:34:50,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:34:50,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59352347] [2023-12-24 16:34:50,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59352347] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:34:50,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:34:50,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2023-12-24 16:34:50,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460290900] [2023-12-24 16:34:50,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:34:50,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 16:34:50,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:34:50,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 16:34:50,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2023-12-24 16:34:50,233 INFO L87 Difference]: Start difference. First operand 332 states and 465 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:34:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:34:51,302 INFO L93 Difference]: Finished difference Result 869 states and 1201 transitions. [2023-12-24 16:34:51,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 16:34:51,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2023-12-24 16:34:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:34:51,305 INFO L225 Difference]: With dead ends: 869 [2023-12-24 16:34:51,305 INFO L226 Difference]: Without dead ends: 538 [2023-12-24 16:34:51,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2023-12-24 16:34:51,307 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 127 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-24 16:34:51,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 962 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-24 16:34:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2023-12-24 16:34:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 347. [2023-12-24 16:34:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 280 states have (on average 1.3071428571428572) internal successors, (366), 280 states have internal predecessors, (366), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:34:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 486 transitions. [2023-12-24 16:34:51,335 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 486 transitions. Word has length 159 [2023-12-24 16:34:51,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:34:51,335 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 486 transitions. [2023-12-24 16:34:51,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:34:51,335 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 486 transitions. [2023-12-24 16:34:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-24 16:34:51,337 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:34:51,337 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:34:51,353 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-24 16:34:51,553 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-24 16:34:51,554 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:34:51,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:34:51,554 INFO L85 PathProgramCache]: Analyzing trace with hash 467791247, now seen corresponding path program 1 times [2023-12-24 16:34:51,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:34:51,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75643721] [2023-12-24 16:34:51,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:34:51,555 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-24 16:34:51,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:34:51,557 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-24 16:34:51,558 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-24 16:34:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:34:52,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 16:34:52,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:34:52,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2023-12-24 16:34:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2023-12-24 16:34:52,138 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:34:52,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:34:52,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75643721] [2023-12-24 16:34:52,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75643721] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:34:52,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:34:52,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:34:52,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413913628] [2023-12-24 16:34:52,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:34:52,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:34:52,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:34:52,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:34:52,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 16:34:52,140 INFO L87 Difference]: Start difference. First operand 347 states and 486 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 16:34:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:34:52,855 INFO L93 Difference]: Finished difference Result 711 states and 998 transitions. [2023-12-24 16:34:52,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 16:34:52,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2023-12-24 16:34:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:34:52,858 INFO L225 Difference]: With dead ends: 711 [2023-12-24 16:34:52,858 INFO L226 Difference]: Without dead ends: 365 [2023-12-24 16:34:52,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 16:34:52,860 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 143 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 16:34:52,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 449 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 16:34:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-12-24 16:34:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 347. [2023-12-24 16:34:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 280 states have (on average 1.2964285714285715) internal successors, (363), 280 states have internal predecessors, (363), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:34:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 483 transitions. [2023-12-24 16:34:52,894 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 483 transitions. Word has length 159 [2023-12-24 16:34:52,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:34:52,895 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 483 transitions. [2023-12-24 16:34:52,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 16:34:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 483 transitions. [2023-12-24 16:34:52,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-24 16:34:52,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:34:52,897 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:34:52,914 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-24 16:34:53,111 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-24 16:34:53,112 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:34:53,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:34:53,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2036697131, now seen corresponding path program 1 times [2023-12-24 16:34:53,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:34:53,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308172257] [2023-12-24 16:34:53,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:34:53,113 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-24 16:34:53,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:34:53,114 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-24 16:34:53,119 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-24 16:34:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:34:53,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 16:34:53,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:34:53,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2023-12-24 16:34:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2023-12-24 16:34:53,769 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:34:53,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:34:53,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308172257] [2023-12-24 16:34:53,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308172257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:34:53,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:34:53,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:34:53,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088974610] [2023-12-24 16:34:53,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:34:53,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:34:53,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:34:53,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:34:53,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 16:34:53,770 INFO L87 Difference]: Start difference. First operand 347 states and 483 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 16:34:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:34:54,499 INFO L93 Difference]: Finished difference Result 711 states and 992 transitions. [2023-12-24 16:34:54,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 16:34:54,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 161 [2023-12-24 16:34:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:34:54,502 INFO L225 Difference]: With dead ends: 711 [2023-12-24 16:34:54,502 INFO L226 Difference]: Without dead ends: 365 [2023-12-24 16:34:54,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 16:34:54,505 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 135 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 16:34:54,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 444 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 16:34:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-12-24 16:34:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 347. [2023-12-24 16:34:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 280 states have (on average 1.2857142857142858) internal successors, (360), 280 states have internal predecessors, (360), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:34:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 480 transitions. [2023-12-24 16:34:54,529 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 480 transitions. Word has length 161 [2023-12-24 16:34:54,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:34:54,529 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 480 transitions. [2023-12-24 16:34:54,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-24 16:34:54,529 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 480 transitions. [2023-12-24 16:34:54,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-24 16:34:54,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:34:54,531 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:34:54,549 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-24 16:34:54,746 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-24 16:34:54,746 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:34:54,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:34:54,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1898750543, now seen corresponding path program 1 times [2023-12-24 16:34:54,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:34:54,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099773892] [2023-12-24 16:34:54,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:34:54,748 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-24 16:34:54,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:34:54,749 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-24 16:34:54,772 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-24 16:35:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:35:13,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 16:35:13,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:35:24,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 69 [2023-12-24 16:35:25,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 57 [2023-12-24 16:35:25,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 46 [2023-12-24 16:35:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 16 proven. 264 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 16:35:26,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:35:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:35:44,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:35:44,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099773892] [2023-12-24 16:35:44,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099773892] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:35:44,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:35:44,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [25] total 29 [2023-12-24 16:35:44,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052195773] [2023-12-24 16:35:44,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:35:44,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:35:44,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:35:44,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:35:44,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2023-12-24 16:35:44,339 INFO L87 Difference]: Start difference. First operand 347 states and 480 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:35:59,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:35:59,657 INFO L93 Difference]: Finished difference Result 908 states and 1236 transitions. [2023-12-24 16:35:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:35:59,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 163 [2023-12-24 16:35:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:35:59,671 INFO L225 Difference]: With dead ends: 908 [2023-12-24 16:35:59,671 INFO L226 Difference]: Without dead ends: 562 [2023-12-24 16:35:59,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2023-12-24 16:35:59,673 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 156 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:35:59,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 396 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2023-12-24 16:35:59,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2023-12-24 16:35:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 471. [2023-12-24 16:35:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 398 states have (on average 1.2839195979899498) internal successors, (511), 401 states have internal predecessors, (511), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 60 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-24 16:35:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 637 transitions. [2023-12-24 16:35:59,702 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 637 transitions. Word has length 163 [2023-12-24 16:35:59,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:35:59,702 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 637 transitions. [2023-12-24 16:35:59,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:35:59,703 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 637 transitions. [2023-12-24 16:35:59,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-24 16:35:59,704 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:35:59,704 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:35:59,725 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-24 16:35:59,920 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-24 16:35:59,920 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:35:59,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:35:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash -385167025, now seen corresponding path program 1 times [2023-12-24 16:35:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:35:59,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623873111] [2023-12-24 16:35:59,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:35:59,922 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-24 16:35:59,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:35:59,923 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-24 16:35:59,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 (15)] Waiting until timeout for monitored process [2023-12-24 16:36:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:36:20,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 16:36:20,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:36:34,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 81 [2023-12-24 16:36:34,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 69 [2023-12-24 16:36:34,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 59 [2023-12-24 16:36:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 16 proven. 264 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 16:36:37,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:36:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:36:52,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:36:52,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623873111] [2023-12-24 16:36:52,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623873111] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:36:52,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:36:52,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [25] total 29 [2023-12-24 16:36:52,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512838767] [2023-12-24 16:36:52,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:36:52,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:36:52,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:36:52,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:36:52,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2023-12-24 16:36:52,010 INFO L87 Difference]: Start difference. First operand 471 states and 637 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:37:05,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:37:05,504 INFO L93 Difference]: Finished difference Result 958 states and 1286 transitions. [2023-12-24 16:37:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:37:05,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 163 [2023-12-24 16:37:05,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:37:05,543 INFO L225 Difference]: With dead ends: 958 [2023-12-24 16:37:05,543 INFO L226 Difference]: Without dead ends: 488 [2023-12-24 16:37:05,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2023-12-24 16:37:05,545 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 85 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:37:05,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 552 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2023-12-24 16:37:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-12-24 16:37:05,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 365. [2023-12-24 16:37:05,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 295 states have (on average 1.2508474576271187) internal successors, (369), 295 states have internal predecessors, (369), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:37:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 489 transitions. [2023-12-24 16:37:05,568 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 489 transitions. Word has length 163 [2023-12-24 16:37:05,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:37:05,568 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 489 transitions. [2023-12-24 16:37:05,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:37:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 489 transitions. [2023-12-24 16:37:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-24 16:37:05,569 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:37:05,569 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:37:05,594 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-24 16:37:05,785 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-24 16:37:05,789 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:37:05,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:37:05,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1973514927, now seen corresponding path program 1 times [2023-12-24 16:37:05,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:37:05,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674903127] [2023-12-24 16:37:05,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:37:05,790 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-24 16:37:05,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:37:05,792 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-24 16:37:05,833 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-24 16:37:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:37:12,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-24 16:37:12,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:37:27,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 83 [2023-12-24 16:37:29,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 90 [2023-12-24 16:37:29,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 66 [2023-12-24 16:37:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 16 proven. 260 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2023-12-24 16:37:31,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:37:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:37:45,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:37:45,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674903127] [2023-12-24 16:37:45,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674903127] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:37:45,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:37:45,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [27] total 33 [2023-12-24 16:37:45,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649951537] [2023-12-24 16:37:45,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:37:45,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 16:37:45,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:37:45,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 16:37:45,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2023-12-24 16:37:45,916 INFO L87 Difference]: Start difference. First operand 365 states and 489 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:01,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:38:01,325 INFO L93 Difference]: Finished difference Result 849 states and 1136 transitions. [2023-12-24 16:38:01,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 16:38:01,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 163 [2023-12-24 16:38:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:38:01,333 INFO L225 Difference]: With dead ends: 849 [2023-12-24 16:38:01,333 INFO L226 Difference]: Without dead ends: 485 [2023-12-24 16:38:01,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=122, Invalid=1138, Unknown=0, NotChecked=0, Total=1260 [2023-12-24 16:38:01,337 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 120 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-12-24 16:38:01,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 760 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2023-12-24 16:38:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2023-12-24 16:38:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 250. [2023-12-24 16:38:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 203 states have (on average 1.2463054187192117) internal successors, (253), 203 states have internal predecessors, (253), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-24 16:38:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 333 transitions. [2023-12-24 16:38:01,361 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 333 transitions. Word has length 163 [2023-12-24 16:38:01,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:38:01,361 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 333 transitions. [2023-12-24 16:38:01,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 333 transitions. [2023-12-24 16:38:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-24 16:38:01,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:38:01,364 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:38:01,382 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 (16)] Ended with exit code 0 [2023-12-24 16:38:01,582 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-24 16:38:01,582 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:38:01,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:38:01,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1921346250, now seen corresponding path program 1 times [2023-12-24 16:38:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:38:01,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082113036] [2023-12-24 16:38:01,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:38:01,583 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-24 16:38:01,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:38:01,584 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-24 16:38:01,586 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-24 16:38:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:38:02,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 16:38:02,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:38:02,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-12-24 16:38:02,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2023-12-24 16:38:02,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2023-12-24 16:38:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:38:02,323 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:38:02,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:38:02,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082113036] [2023-12-24 16:38:02,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082113036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:38:02,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:38:02,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 16:38:02,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562655169] [2023-12-24 16:38:02,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:38:02,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:38:02,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:38:02,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:38:02,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 16:38:02,327 INFO L87 Difference]: Start difference. First operand 250 states and 333 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:38:02,995 INFO L93 Difference]: Finished difference Result 647 states and 866 transitions. [2023-12-24 16:38:02,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 16:38:02,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2023-12-24 16:38:02,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:38:02,998 INFO L225 Difference]: With dead ends: 647 [2023-12-24 16:38:02,998 INFO L226 Difference]: Without dead ends: 519 [2023-12-24 16:38:02,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-24 16:38:02,999 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 226 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 16:38:02,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1067 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 16:38:03,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2023-12-24 16:38:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 125. [2023-12-24 16:38:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.2475247524752475) internal successors, (126), 101 states have internal predecessors, (126), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 16:38:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2023-12-24 16:38:03,014 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 164 [2023-12-24 16:38:03,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:38:03,016 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2023-12-24 16:38:03,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2023-12-24 16:38:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-24 16:38:03,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:38:03,017 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:38:03,034 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-24 16:38:03,234 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-24 16:38:03,234 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:38:03,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:38:03,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1820302779, now seen corresponding path program 1 times [2023-12-24 16:38:03,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:38:03,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080579439] [2023-12-24 16:38:03,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:38:03,235 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-24 16:38:03,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:38:03,236 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-24 16:38:03,237 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-24 16:38:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:38:03,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 16:38:03,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:38:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:38:03,794 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:38:03,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:38:03,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080579439] [2023-12-24 16:38:03,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080579439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:38:03,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:38:03,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:38:03,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240831643] [2023-12-24 16:38:03,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:38:03,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:38:03,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:38:03,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:38:03,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:38:03,797 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:38:03,950 INFO L93 Difference]: Finished difference Result 263 states and 350 transitions. [2023-12-24 16:38:03,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:38:03,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 165 [2023-12-24 16:38:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:38:03,951 INFO L225 Difference]: With dead ends: 263 [2023-12-24 16:38:03,951 INFO L226 Difference]: Without dead ends: 139 [2023-12-24 16:38:03,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:38:03,952 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 39 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 554 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.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:38:03,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 554 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:38:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-24 16:38:03,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 128. [2023-12-24 16:38:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 104 states have internal predecessors, (129), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 16:38:03,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 169 transitions. [2023-12-24 16:38:03,963 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 169 transitions. Word has length 165 [2023-12-24 16:38:03,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:38:03,964 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 169 transitions. [2023-12-24 16:38:03,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:03,964 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 169 transitions. [2023-12-24 16:38:03,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-24 16:38:03,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:38:03,965 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:38:03,980 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-24 16:38:04,178 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-24 16:38:04,179 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:38:04,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:38:04,179 INFO L85 PathProgramCache]: Analyzing trace with hash -359517098, now seen corresponding path program 1 times [2023-12-24 16:38:04,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:38:04,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345368810] [2023-12-24 16:38:04,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:38:04,180 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-24 16:38:04,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:38:04,181 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-24 16:38:04,182 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-24 16:38:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:38:04,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 16:38:04,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:38:08,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-12-24 16:38:08,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-12-24 16:38:09,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-12-24 16:38:09,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2023-12-24 16:38:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 525 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 16:38:09,979 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:38:11,147 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:38:11,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:38:11,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345368810] [2023-12-24 16:38:11,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345368810] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:38:11,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:38:11,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [22] total 28 [2023-12-24 16:38:11,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137288575] [2023-12-24 16:38:11,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:38:11,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 16:38:11,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:38:11,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 16:38:11,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2023-12-24 16:38:11,150 INFO L87 Difference]: Start difference. First operand 128 states and 169 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:38:12,101 INFO L93 Difference]: Finished difference Result 450 states and 587 transitions. [2023-12-24 16:38:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 16:38:12,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-12-24 16:38:12,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:38:12,103 INFO L225 Difference]: With dead ends: 450 [2023-12-24 16:38:12,104 INFO L226 Difference]: Without dead ends: 323 [2023-12-24 16:38:12,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2023-12-24 16:38:12,105 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 527 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 16:38:12,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 531 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 16:38:12,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-12-24 16:38:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 295. [2023-12-24 16:38:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 257 states have (on average 1.2607003891050583) internal successors, (324), 259 states have internal predecessors, (324), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-24 16:38:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 384 transitions. [2023-12-24 16:38:12,128 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 384 transitions. Word has length 167 [2023-12-24 16:38:12,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:38:12,128 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 384 transitions. [2023-12-24 16:38:12,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 384 transitions. [2023-12-24 16:38:12,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-24 16:38:12,129 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:38:12,130 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:38:12,145 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-24 16:38:12,344 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-24 16:38:12,345 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:38:12,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:38:12,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1916257660, now seen corresponding path program 1 times [2023-12-24 16:38:12,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:38:12,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087576467] [2023-12-24 16:38:12,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:38:12,346 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-24 16:38:12,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:38:12,347 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-24 16:38:12,348 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-24 16:38:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:38:12,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:38:12,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:38:13,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 16:38:13,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2023-12-24 16:38:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2023-12-24 16:38:13,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:38:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:38:13,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:38:13,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087576467] [2023-12-24 16:38:13,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087576467] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:38:13,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:38:13,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-12-24 16:38:13,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309720647] [2023-12-24 16:38:13,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:38:13,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:38:13,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:38:13,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:38:13,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:38:13,767 INFO L87 Difference]: Start difference. First operand 295 states and 384 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:38:13,930 INFO L93 Difference]: Finished difference Result 663 states and 867 transitions. [2023-12-24 16:38:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:38:13,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-12-24 16:38:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:38:13,934 INFO L225 Difference]: With dead ends: 663 [2023-12-24 16:38:13,934 INFO L226 Difference]: Without dead ends: 369 [2023-12-24 16:38:13,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-24 16:38:13,935 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 114 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:38:13,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 733 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:38:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-12-24 16:38:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 365. [2023-12-24 16:38:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 308 states have (on average 1.25) internal successors, (385), 311 states have internal predecessors, (385), 46 states have call successors, (46), 10 states have call predecessors, (46), 10 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-24 16:38:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 477 transitions. [2023-12-24 16:38:13,964 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 477 transitions. Word has length 167 [2023-12-24 16:38:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:38:13,964 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 477 transitions. [2023-12-24 16:38:13,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 477 transitions. [2023-12-24 16:38:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-24 16:38:13,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:38:13,965 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:38:13,979 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-24 16:38:14,179 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-24 16:38:14,179 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:38:14,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:38:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1916317242, now seen corresponding path program 1 times [2023-12-24 16:38:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:38:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000145352] [2023-12-24 16:38:14,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:38:14,180 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-24 16:38:14,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:38:14,181 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-24 16:38:14,182 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-24 16:38:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:38:14,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 16:38:14,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:38:15,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 16:38:15,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2023-12-24 16:38:15,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2023-12-24 16:38:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-24 16:38:15,719 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:38:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:38:15,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:38:15,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000145352] [2023-12-24 16:38:15,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000145352] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:38:15,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:38:15,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2023-12-24 16:38:15,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471796983] [2023-12-24 16:38:15,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:38:15,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:38:15,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:38:15,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:38:15,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-24 16:38:15,888 INFO L87 Difference]: Start difference. First operand 365 states and 477 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:38:16,050 INFO L93 Difference]: Finished difference Result 373 states and 487 transitions. [2023-12-24 16:38:16,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:38:16,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-12-24 16:38:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:38:16,052 INFO L225 Difference]: With dead ends: 373 [2023-12-24 16:38:16,052 INFO L226 Difference]: Without dead ends: 371 [2023-12-24 16:38:16,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-24 16:38:16,052 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 116 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:38:16,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 405 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:38:16,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-12-24 16:38:16,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2023-12-24 16:38:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 314 states have (on average 1.2452229299363058) internal successors, (391), 317 states have internal predecessors, (391), 46 states have call successors, (46), 10 states have call predecessors, (46), 10 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-24 16:38:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 483 transitions. [2023-12-24 16:38:16,081 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 483 transitions. Word has length 167 [2023-12-24 16:38:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:38:16,082 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 483 transitions. [2023-12-24 16:38:16,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 483 transitions. [2023-12-24 16:38:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-24 16:38:16,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:38:16,083 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:38:16,097 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-24 16:38:16,297 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-24 16:38:16,298 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:38:16,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:38:16,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1858999358, now seen corresponding path program 1 times [2023-12-24 16:38:16,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:38:16,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826649103] [2023-12-24 16:38:16,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:38:16,299 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-24 16:38:16,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:38:16,300 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-24 16:38:16,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-24 16:38:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:38:16,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 16:38:16,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:38:17,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-24 16:38:17,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-24 16:38:17,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 16:38:17,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2023-12-24 16:38:17,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2023-12-24 16:38:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:38:17,268 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:38:17,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:38:17,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826649103] [2023-12-24 16:38:17,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826649103] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:38:17,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:38:17,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 16:38:17,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709029660] [2023-12-24 16:38:17,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:38:17,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 16:38:17,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:38:17,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 16:38:17,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:38:17,270 INFO L87 Difference]: Start difference. First operand 371 states and 483 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:38:18,091 INFO L93 Difference]: Finished difference Result 1413 states and 1820 transitions. [2023-12-24 16:38:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 16:38:18,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-12-24 16:38:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:38:18,101 INFO L225 Difference]: With dead ends: 1413 [2023-12-24 16:38:18,101 INFO L226 Difference]: Without dead ends: 1103 [2023-12-24 16:38:18,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-12-24 16:38:18,103 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 511 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 16:38:18,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1089 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 16:38:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2023-12-24 16:38:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1076. [2023-12-24 16:38:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 915 states have (on average 1.2404371584699454) internal successors, (1135), 922 states have internal predecessors, (1135), 128 states have call successors, (128), 32 states have call predecessors, (128), 32 states have return successors, (128), 121 states have call predecessors, (128), 128 states have call successors, (128) [2023-12-24 16:38:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1391 transitions. [2023-12-24 16:38:18,205 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1391 transitions. Word has length 167 [2023-12-24 16:38:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:38:18,206 INFO L495 AbstractCegarLoop]: Abstraction has 1076 states and 1391 transitions. [2023-12-24 16:38:18,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1391 transitions. [2023-12-24 16:38:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-24 16:38:18,208 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:38:18,208 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:38:18,224 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-24 16:38:18,422 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-24 16:38:18,422 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:38:18,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:38:18,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1626621312, now seen corresponding path program 1 times [2023-12-24 16:38:18,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:38:18,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510868122] [2023-12-24 16:38:18,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:38:18,423 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-24 16:38:18,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:38:18,425 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-24 16:38:18,460 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-24 16:38:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:38:19,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-24 16:38:19,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:38:20,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2023-12-24 16:38:21,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 106 [2023-12-24 16:38:21,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 88 [2023-12-24 16:38:21,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2023-12-24 16:38:21,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2023-12-24 16:38:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 46 proven. 312 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2023-12-24 16:38:21,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:38:21,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2023-12-24 16:38:21,478 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:38:21,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:38:21,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510868122] [2023-12-24 16:38:21,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510868122] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:38:21,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:38:21,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2023-12-24 16:38:21,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647412550] [2023-12-24 16:38:21,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:38:21,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:38:21,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:38:21,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:38:21,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-24 16:38:21,480 INFO L87 Difference]: Start difference. First operand 1076 states and 1391 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:22,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:38:22,047 INFO L93 Difference]: Finished difference Result 2374 states and 3060 transitions. [2023-12-24 16:38:22,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 16:38:22,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-12-24 16:38:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:38:22,055 INFO L225 Difference]: With dead ends: 2374 [2023-12-24 16:38:22,055 INFO L226 Difference]: Without dead ends: 1359 [2023-12-24 16:38:22,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2023-12-24 16:38:22,058 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 143 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 16:38:22,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 963 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 16:38:22,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2023-12-24 16:38:22,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1309. [2023-12-24 16:38:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1309 states, 1106 states have (on average 1.2278481012658229) internal successors, (1358), 1115 states have internal predecessors, (1358), 164 states have call successors, (164), 38 states have call predecessors, (164), 38 states have return successors, (164), 155 states have call predecessors, (164), 164 states have call successors, (164) [2023-12-24 16:38:22,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1686 transitions. [2023-12-24 16:38:22,196 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1686 transitions. Word has length 167 [2023-12-24 16:38:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:38:22,197 INFO L495 AbstractCegarLoop]: Abstraction has 1309 states and 1686 transitions. [2023-12-24 16:38:22,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:22,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1686 transitions. [2023-12-24 16:38:22,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-24 16:38:22,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:38:22,198 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:38:22,212 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-24 16:38:22,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:38:22,412 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:38:22,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:38:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash 382320267, now seen corresponding path program 1 times [2023-12-24 16:38:22,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:38:22,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393763419] [2023-12-24 16:38:22,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:38:22,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:38:22,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:38:22,414 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:38:22,415 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-24 16:38:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:38:22,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:38:22,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:38:23,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 16:38:23,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2023-12-24 16:38:23,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-12-24 16:38:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:38:23,439 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:38:23,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:38:23,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393763419] [2023-12-24 16:38:23,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393763419] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:38:23,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:38:23,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:38:23,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242760822] [2023-12-24 16:38:23,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:38:23,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:38:23,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:38:23,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:38:23,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 16:38:23,441 INFO L87 Difference]: Start difference. First operand 1309 states and 1686 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:23,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:38:23,900 INFO L93 Difference]: Finished difference Result 3010 states and 3868 transitions. [2023-12-24 16:38:23,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:38:23,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-12-24 16:38:23,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:38:23,907 INFO L225 Difference]: With dead ends: 3010 [2023-12-24 16:38:23,907 INFO L226 Difference]: Without dead ends: 1762 [2023-12-24 16:38:23,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 16:38:23,910 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 179 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:38:23,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1013 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 16:38:23,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2023-12-24 16:38:24,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1097. [2023-12-24 16:38:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 931 states have (on average 1.2277121374865736) internal successors, (1143), 939 states have internal predecessors, (1143), 134 states have call successors, (134), 31 states have call predecessors, (134), 31 states have return successors, (134), 126 states have call predecessors, (134), 134 states have call successors, (134) [2023-12-24 16:38:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1411 transitions. [2023-12-24 16:38:24,040 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1411 transitions. Word has length 167 [2023-12-24 16:38:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:38:24,040 INFO L495 AbstractCegarLoop]: Abstraction has 1097 states and 1411 transitions. [2023-12-24 16:38:24,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1411 transitions. [2023-12-24 16:38:24,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-24 16:38:24,043 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:38:24,043 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:38:24,060 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-24 16:38:24,260 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-24 16:38:24,260 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:38:24,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:38:24,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1563710936, now seen corresponding path program 1 times [2023-12-24 16:38:24,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:38:24,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020982896] [2023-12-24 16:38:24,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:38:24,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:38:24,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:38:24,262 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-24 16:38:24,263 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-24 16:38:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:38:24,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 16:38:24,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:38:26,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-24 16:38:27,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-12-24 16:38:27,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-12-24 16:38:27,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2023-12-24 16:38:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 1 proven. 531 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-12-24 16:38:28,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:38:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:38:28,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:38:28,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020982896] [2023-12-24 16:38:28,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020982896] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:38:28,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:38:28,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2023-12-24 16:38:28,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473778293] [2023-12-24 16:38:28,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:38:28,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 16:38:28,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:38:28,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 16:38:28,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-12-24 16:38:28,859 INFO L87 Difference]: Start difference. First operand 1097 states and 1411 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:38:29,794 INFO L93 Difference]: Finished difference Result 2197 states and 2801 transitions. [2023-12-24 16:38:29,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 16:38:29,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-12-24 16:38:29,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:38:29,800 INFO L225 Difference]: With dead ends: 2197 [2023-12-24 16:38:29,800 INFO L226 Difference]: Without dead ends: 1169 [2023-12-24 16:38:29,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2023-12-24 16:38:29,803 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 432 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 16:38:29,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 582 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 16:38:29,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-12-24 16:38:29,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1108. [2023-12-24 16:38:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 932 states have (on average 1.2178111587982832) internal successors, (1135), 940 states have internal predecessors, (1135), 138 states have call successors, (138), 37 states have call predecessors, (138), 37 states have return successors, (138), 130 states have call predecessors, (138), 138 states have call successors, (138) [2023-12-24 16:38:29,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1411 transitions. [2023-12-24 16:38:29,923 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1411 transitions. Word has length 167 [2023-12-24 16:38:29,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:38:29,924 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1411 transitions. [2023-12-24 16:38:29,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:29,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1411 transitions. [2023-12-24 16:38:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-24 16:38:29,925 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:38:29,925 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:38:29,943 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-24 16:38:30,140 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-24 16:38:30,141 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:38:30,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:38:30,141 INFO L85 PathProgramCache]: Analyzing trace with hash -745117950, now seen corresponding path program 1 times [2023-12-24 16:38:30,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:38:30,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744394845] [2023-12-24 16:38:30,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:38:30,142 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-24 16:38:30,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:38:30,143 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-24 16:38:30,144 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-24 16:38:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:38:30,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 16:38:30,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:38:31,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2023-12-24 16:38:31,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2023-12-24 16:38:31,977 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 26 proven. 342 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2023-12-24 16:38:31,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:38:32,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2023-12-24 16:38:32,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:38:32,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744394845] [2023-12-24 16:38:32,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744394845] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:38:32,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1317171795] [2023-12-24 16:38:32,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:38:32,790 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 16:38:32,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 16:38:32,796 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 16:38:32,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-12-24 16:38:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:38:34,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 16:38:34,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:38:34,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 16:38:35,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2023-12-24 16:38:35,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-12-24 16:38:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 301 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2023-12-24 16:38:36,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:38:36,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2023-12-24 16:38:36,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1317171795] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:38:36,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 16:38:36,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 23 [2023-12-24 16:38:36,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247233903] [2023-12-24 16:38:36,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 16:38:36,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 16:38:36,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:38:36,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 16:38:36,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2023-12-24 16:38:36,856 INFO L87 Difference]: Start difference. First operand 1108 states and 1411 transitions. Second operand has 24 states, 21 states have (on average 6.904761904761905) internal successors, (145), 20 states have internal predecessors, (145), 7 states have call successors, (40), 6 states have call predecessors, (40), 7 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) [2023-12-24 16:38:40,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:38:40,512 INFO L93 Difference]: Finished difference Result 2211 states and 2765 transitions. [2023-12-24 16:38:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-24 16:38:40,513 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.904761904761905) internal successors, (145), 20 states have internal predecessors, (145), 7 states have call successors, (40), 6 states have call predecessors, (40), 7 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) Word has length 167 [2023-12-24 16:38:40,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:38:40,517 INFO L225 Difference]: With dead ends: 2211 [2023-12-24 16:38:40,517 INFO L226 Difference]: Without dead ends: 1172 [2023-12-24 16:38:40,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=397, Invalid=1765, Unknown=0, NotChecked=0, Total=2162 [2023-12-24 16:38:40,519 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 699 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:38:40,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1892 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-24 16:38:40,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2023-12-24 16:38:40,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 999. [2023-12-24 16:38:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 833 states have (on average 1.1992797118847538) internal successors, (999), 839 states have internal predecessors, (999), 122 states have call successors, (122), 43 states have call predecessors, (122), 43 states have return successors, (122), 116 states have call predecessors, (122), 122 states have call successors, (122) [2023-12-24 16:38:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1243 transitions. [2023-12-24 16:38:40,632 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1243 transitions. Word has length 167 [2023-12-24 16:38:40,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:38:40,632 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 1243 transitions. [2023-12-24 16:38:40,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.904761904761905) internal successors, (145), 20 states have internal predecessors, (145), 7 states have call successors, (40), 6 states have call predecessors, (40), 7 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) [2023-12-24 16:38:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1243 transitions. [2023-12-24 16:38:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-24 16:38:40,634 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:38:40,634 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:38:40,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2023-12-24 16:38:40,859 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-24 16:38:41,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-24 16:38:41,049 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:38:41,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:38:41,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1889857875, now seen corresponding path program 1 times [2023-12-24 16:38:41,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:38:41,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654888312] [2023-12-24 16:38:41,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:38:41,050 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-24 16:38:41,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:38:41,051 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-24 16:38:41,052 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-24 16:38:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:38:41,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 16:38:41,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:38:41,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 16:38:41,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2023-12-24 16:38:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:38:41,831 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:38:41,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:38:41,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654888312] [2023-12-24 16:38:41,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654888312] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:38:41,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:38:41,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 16:38:41,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081659484] [2023-12-24 16:38:41,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:38:41,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 16:38:41,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:38:41,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 16:38:41,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:38:41,833 INFO L87 Difference]: Start difference. First operand 999 states and 1243 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:38:42,409 INFO L93 Difference]: Finished difference Result 1925 states and 2387 transitions. [2023-12-24 16:38:42,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 16:38:42,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2023-12-24 16:38:42,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:38:42,414 INFO L225 Difference]: With dead ends: 1925 [2023-12-24 16:38:42,414 INFO L226 Difference]: Without dead ends: 1237 [2023-12-24 16:38:42,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2023-12-24 16:38:42,415 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 154 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:38:42,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1226 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 16:38:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2023-12-24 16:38:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1027. [2023-12-24 16:38:42,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 839 states have (on average 1.1883194278903457) internal successors, (997), 845 states have internal predecessors, (997), 138 states have call successors, (138), 49 states have call predecessors, (138), 49 states have return successors, (138), 132 states have call predecessors, (138), 138 states have call successors, (138) [2023-12-24 16:38:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1273 transitions. [2023-12-24 16:38:42,557 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1273 transitions. Word has length 168 [2023-12-24 16:38:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:38:42,557 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1273 transitions. [2023-12-24 16:38:42,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1273 transitions. [2023-12-24 16:38:42,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-24 16:38:42,558 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:38:42,558 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:38:42,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-24 16:38:42,775 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-24 16:38:42,775 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:38:42,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:38:42,776 INFO L85 PathProgramCache]: Analyzing trace with hash 390375615, now seen corresponding path program 1 times [2023-12-24 16:38:42,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:38:42,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095860842] [2023-12-24 16:38:42,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:38:42,776 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-24 16:38:42,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:38:42,777 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-24 16:38:42,778 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-24 16:38:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:38:43,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 16:38:43,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:38:43,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-12-24 16:38:43,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 16:38:43,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2023-12-24 16:38:43,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2023-12-24 16:38:43,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2023-12-24 16:38:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 16:38:43,715 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:38:43,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:38:43,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095860842] [2023-12-24 16:38:43,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095860842] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:38:43,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:38:43,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 16:38:43,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934845120] [2023-12-24 16:38:43,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:38:43,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 16:38:43,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:38:43,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 16:38:43,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-24 16:38:43,716 INFO L87 Difference]: Start difference. First operand 1027 states and 1273 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:45,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:38:45,552 INFO L93 Difference]: Finished difference Result 2365 states and 2914 transitions. [2023-12-24 16:38:45,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 16:38:45,562 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2023-12-24 16:38:45,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:38:45,562 INFO L225 Difference]: With dead ends: 2365 [2023-12-24 16:38:45,562 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 16:38:45,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-12-24 16:38:45,565 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 349 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-24 16:38:45,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1672 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-24 16:38:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 16:38:45,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 16:38:45,565 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-24 16:38:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 16:38:45,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 168 [2023-12-24 16:38:45,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:38:45,566 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 16:38:45,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-24 16:38:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 16:38:45,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 16:38:45,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 16:38:45,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-12-24 16:38:45,782 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-24 16:38:45,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 16:39:12,322 WARN L293 SmtUtils]: Spent 7.91s on a formula simplification. DAG size of input: 278 DAG size of output: 145 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:39:47,650 WARN L293 SmtUtils]: Spent 24.97s on a formula simplification. DAG size of input: 929 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:40:02,172 WARN L293 SmtUtils]: Spent 7.77s on a formula simplification. DAG size of input: 321 DAG size of output: 145 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:40:03,013 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 16:40:03,013 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 16:40:03,013 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 16:40:03,013 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 16:40:03,014 INFO L895 garLoopResultBuilder]: At program point L118(line 118) the Hoare annotation is: (let ((.cse12 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32)))))) (let ((.cse10 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse0 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse1 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse2 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse3 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse4 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse5 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse6 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse7 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse8 (bvsle .cse12 (_ bv16383 32))) (.cse9 (bvsge .cse12 (_ bv8191 32))) (.cse11 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse10 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse11 (= ((_ sign_extend 16) ((_ extract 15 0) .cse10)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))) (and (= ((_ sign_extend 16) (_ bv64 16)) .cse10) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))))) [2023-12-24 16:40:03,014 INFO L899 garLoopResultBuilder]: For program point L118-1(line 118) no Hoare annotation was computed. [2023-12-24 16:40:03,014 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 16:40:03,014 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 16:40:03,014 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 16:40:03,014 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse12 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32)))))) (let ((.cse1 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse2 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse3 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse4 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse5 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse6 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse7 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse8 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse9 (bvsle .cse12 (_ bv16383 32))) (.cse10 (bvsge .cse12 (_ bv8191 32))) (.cse11 (= currentRoundingMode roundNearestTiesToEven)) (.cse0 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (or (and (= ((_ sign_extend 16) (_ bv64 16)) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) .cse9 .cse10 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse0 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse11 (= ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))))) [2023-12-24 16:40:03,014 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-12-24 16:40:03,015 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse12 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32)))))) (let ((.cse1 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse2 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse3 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse4 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse5 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse6 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse7 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse8 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse9 (bvsle .cse12 (_ bv16383 32))) (.cse10 (bvsge .cse12 (_ bv8191 32))) (.cse11 (= currentRoundingMode roundNearestTiesToEven)) (.cse0 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (or (and (= ((_ sign_extend 16) (_ bv64 16)) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) .cse9 .cse10 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse0 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse11 (= ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))))) [2023-12-24 16:40:03,015 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-12-24 16:40:03,015 INFO L895 garLoopResultBuilder]: At program point L120(line 120) the Hoare annotation is: (let ((.cse11 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32)))))) (let ((.cse9 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse0 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse1 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse2 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse3 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse4 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse5 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse6 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse7 (bvsle .cse11 (_ bv16383 32))) (.cse8 (bvsge .cse11 (_ bv8191 32))) (.cse10 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse9 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse10 (= ((_ sign_extend 16) ((_ extract 15 0) .cse9)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))) (and (= ((_ sign_extend 16) (_ bv64 16)) .cse9) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))))) [2023-12-24 16:40:03,015 INFO L899 garLoopResultBuilder]: For program point L120-1(line 120) no Hoare annotation was computed. [2023-12-24 16:40:03,016 INFO L895 garLoopResultBuilder]: At program point L121(line 121) the Hoare annotation is: (let ((.cse12 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32)))))) (let ((.cse10 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse0 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse1 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse2 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse3 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse4 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse5 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse6 (or (not (bvsle ((_ zero_extend 24) |ULTIMATE.start_updateVariables_#t~mem91#1|) (_ bv0 32))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32)))) (.cse7 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse8 (bvsle .cse12 (_ bv16383 32))) (.cse9 (bvsge .cse12 (_ bv8191 32))) (.cse11 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse10 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse11 (= ((_ sign_extend 16) ((_ extract 15 0) .cse10)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))) (and (= ((_ sign_extend 16) (_ bv64 16)) .cse10) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))))) [2023-12-24 16:40:03,016 INFO L899 garLoopResultBuilder]: For program point L121-1(line 121) no Hoare annotation was computed. [2023-12-24 16:40:03,016 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (let ((.cse12 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32)))))) (let ((.cse1 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse2 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse3 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse4 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse5 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse6 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse7 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse8 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse9 (bvsle .cse12 (_ bv16383 32))) (.cse10 (bvsge .cse12 (_ bv8191 32))) (.cse11 (= currentRoundingMode roundNearestTiesToEven)) (.cse0 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (or (and (= ((_ sign_extend 16) (_ bv64 16)) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) .cse9 .cse10 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse0 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse11 (= ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))))) [2023-12-24 16:40:03,016 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-12-24 16:40:03,016 INFO L895 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: (let ((.cse12 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32)))))) (let ((.cse1 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse2 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse3 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse4 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse5 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse6 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse7 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse8 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse9 (bvsle .cse12 (_ bv16383 32))) (.cse10 (bvsge .cse12 (_ bv8191 32))) (.cse11 (= currentRoundingMode roundNearestTiesToEven)) (.cse0 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (or (and (= ((_ sign_extend 16) (_ bv64 16)) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) .cse9 .cse10 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse0 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse11 (= ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))))) [2023-12-24 16:40:03,016 INFO L899 garLoopResultBuilder]: For program point L106-1(line 106) no Hoare annotation was computed. [2023-12-24 16:40:03,017 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 75) no Hoare annotation was computed. [2023-12-24 16:40:03,017 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 75) no Hoare annotation was computed. [2023-12-24 16:40:03,017 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 16:40:03,017 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-12-24 16:40:03,017 INFO L899 garLoopResultBuilder]: For program point L91-2(line 91) no Hoare annotation was computed. [2023-12-24 16:40:03,017 INFO L899 garLoopResultBuilder]: For program point L91-3(line 91) no Hoare annotation was computed. [2023-12-24 16:40:03,017 INFO L899 garLoopResultBuilder]: For program point L91-5(line 91) no Hoare annotation was computed. [2023-12-24 16:40:03,017 INFO L899 garLoopResultBuilder]: For program point L91-7(line 91) no Hoare annotation was computed. [2023-12-24 16:40:03,017 INFO L895 garLoopResultBuilder]: At program point L91-8(line 91) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse14 (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)) (.cse18 ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset))) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset)))) (.cse22 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32))))) (.cse20 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset))))) (let ((.cse8 (exists ((|v_ULTIMATE.start_step_#t~mem15#1_47| (_ BitVec 8))) (not (bvsge ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem15#1_47|) (bvxor .cse22 .cse20))))) (.cse1 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse2 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse3 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse4 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse5 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse6 (bvsle .cse21 (_ bv0 32))) (.cse7 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse15 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset))))) (.cse19 (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#13| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) .cse14))) ((_ zero_extend 24) .cse18)))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset))))) (.cse9 (bvsle .cse22 (_ bv16383 32))) (.cse10 (bvsge .cse22 (_ bv8191 32))) (.cse11 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset))) .cse21)) (.cse12 (not (bvsgt .cse20 (bvshl ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset))))))) (.cse16 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse0 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66)))))) (.cse13 (= currentRoundingMode roundNearestTiesToEven)) (.cse17 (= ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))) (or (and (= ((_ sign_extend 16) (_ bv64 16)) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ((_ sign_extend 24) (_ bv2 8)) .cse14)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse16 .cse13 .cse17) (and .cse1 (= ((_ sign_extend 24) .cse18) .cse14) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse19 .cse9 .cse10 .cse11 .cse16 .cse13 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse19 .cse9 .cse10 .cse11 .cse12 .cse16 .cse13 .cse17)))) [2023-12-24 16:40:03,018 INFO L899 garLoopResultBuilder]: For program point L91-9(line 91) no Hoare annotation was computed. [2023-12-24 16:40:03,018 INFO L895 garLoopResultBuilder]: At program point L108(line 108) the Hoare annotation is: (let ((.cse12 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32)))))) (let ((.cse1 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse2 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse3 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse4 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse5 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse6 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse7 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse8 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse9 (bvsle .cse12 (_ bv16383 32))) (.cse10 (bvsge .cse12 (_ bv8191 32))) (.cse11 (= currentRoundingMode roundNearestTiesToEven)) (.cse0 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (or (and (= ((_ sign_extend 16) (_ bv64 16)) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) .cse9 .cse10 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse0 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse11 (= ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))))) [2023-12-24 16:40:03,018 INFO L899 garLoopResultBuilder]: For program point L108-1(line 108) no Hoare annotation was computed. [2023-12-24 16:40:03,018 INFO L895 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse12 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32)))))) (let ((.cse1 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse2 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse3 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse4 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse5 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse6 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse7 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse8 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse9 (bvsle .cse12 (_ bv16383 32))) (.cse10 (bvsge .cse12 (_ bv8191 32))) (.cse11 (= currentRoundingMode roundNearestTiesToEven)) (.cse0 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (or (and (= ((_ sign_extend 16) (_ bv64 16)) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) .cse9 .cse10 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse0 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse11 (= ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))))) [2023-12-24 16:40:03,018 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2023-12-24 16:40:03,018 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-12-24 16:40:03,018 INFO L899 garLoopResultBuilder]: For program point L76-2(lines 76 86) no Hoare annotation was computed. [2023-12-24 16:40:03,018 INFO L899 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,019 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2023-12-24 16:40:03,019 INFO L899 garLoopResultBuilder]: For program point L126-2(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,019 INFO L899 garLoopResultBuilder]: For program point L93-2(line 93) no Hoare annotation was computed. [2023-12-24 16:40:03,019 INFO L899 garLoopResultBuilder]: For program point L126-3(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,019 INFO L899 garLoopResultBuilder]: For program point L93-3(line 93) no Hoare annotation was computed. [2023-12-24 16:40:03,019 INFO L899 garLoopResultBuilder]: For program point L126-5(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,019 INFO L899 garLoopResultBuilder]: For program point L93-5(line 93) no Hoare annotation was computed. [2023-12-24 16:40:03,019 INFO L899 garLoopResultBuilder]: For program point L126-7(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,019 INFO L899 garLoopResultBuilder]: For program point L93-7(line 93) no Hoare annotation was computed. [2023-12-24 16:40:03,019 INFO L895 garLoopResultBuilder]: At program point L93-8(line 93) the Hoare annotation is: (let ((.cse17 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse3 (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)) (.cse2 ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset))) (.cse21 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32))))) (.cse20 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset))))) (let ((.cse18 (exists ((|v_ULTIMATE.start_step_#t~mem15#1_47| (_ BitVec 8))) (not (bvsge ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem15#1_47|) (bvxor .cse21 .cse20))))) (.cse0 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse1 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse4 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse5 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse6 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse7 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse8 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse9 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse10 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset))))) (.cse11 (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#13| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) .cse3))) ((_ zero_extend 24) .cse2)))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset))))) (.cse12 (bvsle .cse21 (_ bv16383 32))) (.cse13 (bvsge .cse21 (_ bv8191 32))) (.cse19 (not (bvsgt .cse20 (bvshl ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset))))))) (.cse14 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse17 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66)))))) (.cse15 (= currentRoundingMode roundNearestTiesToEven)) (.cse16 (= ((_ sign_extend 16) ((_ extract 15 0) .cse17)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))) (or (and .cse0 .cse1 (= ((_ sign_extend 24) .cse2) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ((_ sign_extend 16) (_ bv64 16)) .cse17) .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse12 .cse13 .cse19 .cse15 (= ((_ sign_extend 24) (_ bv2 8)) .cse3)) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14 .cse15 .cse16)))) [2023-12-24 16:40:03,020 INFO L899 garLoopResultBuilder]: For program point L126-9(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,020 INFO L899 garLoopResultBuilder]: For program point L93-9(line 93) no Hoare annotation was computed. [2023-12-24 16:40:03,020 INFO L899 garLoopResultBuilder]: For program point L126-10(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,020 INFO L899 garLoopResultBuilder]: For program point L126-11(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,020 INFO L899 garLoopResultBuilder]: For program point L126-12(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,020 INFO L899 garLoopResultBuilder]: For program point L126-13(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,020 INFO L899 garLoopResultBuilder]: For program point L126-15(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,020 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 79) no Hoare annotation was computed. [2023-12-24 16:40:03,020 INFO L899 garLoopResultBuilder]: For program point L126-17(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,020 INFO L899 garLoopResultBuilder]: For program point L126-19(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,020 INFO L899 garLoopResultBuilder]: For program point L126-20(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,020 INFO L899 garLoopResultBuilder]: For program point L126-21(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,020 INFO L899 garLoopResultBuilder]: For program point L126-23(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,020 INFO L899 garLoopResultBuilder]: For program point L126-25(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,021 INFO L899 garLoopResultBuilder]: For program point L126-26(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,021 INFO L899 garLoopResultBuilder]: For program point L126-28(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,021 INFO L899 garLoopResultBuilder]: For program point L126-29(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,021 INFO L899 garLoopResultBuilder]: For program point L126-31(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,021 INFO L899 garLoopResultBuilder]: For program point L126-32(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,021 INFO L899 garLoopResultBuilder]: For program point L126-34(line 126) no Hoare annotation was computed. [2023-12-24 16:40:03,021 INFO L895 garLoopResultBuilder]: At program point L111(line 111) the Hoare annotation is: (let ((.cse12 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32)))))) (let ((.cse1 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse2 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse3 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse4 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse5 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse6 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse7 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse8 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse9 (bvsle .cse12 (_ bv16383 32))) (.cse10 (bvsge .cse12 (_ bv8191 32))) (.cse11 (= currentRoundingMode roundNearestTiesToEven)) (.cse0 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (or (and (= ((_ sign_extend 16) (_ bv64 16)) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) .cse9 .cse10 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse0 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse11 (= ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))))) [2023-12-24 16:40:03,021 INFO L899 garLoopResultBuilder]: For program point L111-1(line 111) no Hoare annotation was computed. [2023-12-24 16:40:03,021 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2023-12-24 16:40:03,021 INFO L899 garLoopResultBuilder]: For program point L95-2(line 95) no Hoare annotation was computed. [2023-12-24 16:40:03,021 INFO L899 garLoopResultBuilder]: For program point L95-3(line 95) no Hoare annotation was computed. [2023-12-24 16:40:03,021 INFO L899 garLoopResultBuilder]: For program point L95-5(line 95) no Hoare annotation was computed. [2023-12-24 16:40:03,021 INFO L899 garLoopResultBuilder]: For program point L95-7(line 95) no Hoare annotation was computed. [2023-12-24 16:40:03,022 INFO L895 garLoopResultBuilder]: At program point L95-8(line 95) the Hoare annotation is: (let ((.cse23 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32))))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset)))) (.cse20 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse21 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)))) (.cse2 (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)) (.cse1 ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))) (let ((.cse11 (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#13| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) .cse2))) ((_ zero_extend 24) .cse1)))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset))))) (.cse10 (= .cse21 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset))))) (.cse15 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse20 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66)))))) (.cse17 (= ((_ sign_extend 16) ((_ extract 15 0) .cse20)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))) (.cse0 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse3 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse4 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse5 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse6 (not |ULTIMATE.start_updateVariables_#t~short55#1|)) (.cse7 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse8 (bvsle .cse22 (_ bv0 32))) (.cse9 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse19 (exists ((|v_ULTIMATE.start_step_#t~mem15#1_47| (_ BitVec 8))) (not (bvsge ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem15#1_47|) (bvxor .cse23 .cse21))))) (.cse12 (bvsle .cse23 (_ bv16383 32))) (.cse13 (bvsge .cse23 (_ bv8191 32))) (.cse14 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset))) .cse22)) (.cse18 (not (bvsgt .cse21 (bvshl ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset))))))) (.cse16 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 (= ((_ sign_extend 24) .cse1) .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15 .cse16 .cse17) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= ((_ sign_extend 16) (_ bv64 16)) .cse20) .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse12 .cse13 .cse14 .cse18 .cse16 (= ((_ sign_extend 24) (_ bv2 8)) .cse2))))) [2023-12-24 16:40:03,022 INFO L899 garLoopResultBuilder]: For program point L95-9(line 95) no Hoare annotation was computed. [2023-12-24 16:40:03,022 INFO L895 garLoopResultBuilder]: At program point L112(line 112) the Hoare annotation is: (let ((.cse12 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32)))))) (let ((.cse1 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse2 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse3 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse4 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse5 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse6 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse7 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse8 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse9 (bvsle .cse12 (_ bv16383 32))) (.cse10 (bvsge .cse12 (_ bv8191 32))) (.cse11 (= currentRoundingMode roundNearestTiesToEven)) (.cse0 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (or (and (= ((_ sign_extend 16) (_ bv64 16)) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) .cse9 .cse10 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse0 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse11 (= ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))))) [2023-12-24 16:40:03,022 INFO L899 garLoopResultBuilder]: For program point L112-1(line 112) no Hoare annotation was computed. [2023-12-24 16:40:03,022 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 16:40:03,022 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-12-24 16:40:03,022 INFO L899 garLoopResultBuilder]: For program point L97-2(line 97) no Hoare annotation was computed. [2023-12-24 16:40:03,022 INFO L899 garLoopResultBuilder]: For program point L97-3(line 97) no Hoare annotation was computed. [2023-12-24 16:40:03,023 INFO L899 garLoopResultBuilder]: For program point L97-5(line 97) no Hoare annotation was computed. [2023-12-24 16:40:03,023 INFO L899 garLoopResultBuilder]: For program point L97-7(line 97) no Hoare annotation was computed. [2023-12-24 16:40:03,023 INFO L895 garLoopResultBuilder]: At program point L97-8(line 97) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse15 (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)) (.cse19 ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset))) (.cse22 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32))))) (.cse21 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset))))) (let ((.cse10 (exists ((|v_ULTIMATE.start_step_#t~mem15#1_47| (_ BitVec 8))) (not (bvsge ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem15#1_47|) (bvxor .cse22 .cse21))))) (.cse1 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse2 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse3 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse4 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse5 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse6 (not |ULTIMATE.start_updateVariables_#t~short63#1|)) (.cse7 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse8 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse9 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse16 (= .cse21 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset))))) (.cse20 (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#13| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) .cse15))) ((_ zero_extend 24) .cse19)))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset))))) (.cse11 (bvsle .cse22 (_ bv16383 32))) (.cse12 (bvsge .cse22 (_ bv8191 32))) (.cse13 (not (bvsgt .cse21 (bvshl ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset))))))) (.cse17 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse0 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66)))))) (.cse14 (= currentRoundingMode roundNearestTiesToEven)) (.cse18 (= ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))) (or (and (= ((_ sign_extend 16) (_ bv64 16)) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ((_ sign_extend 24) (_ bv2 8)) .cse15)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse17 .cse14 .cse18) (and .cse1 .cse2 (= ((_ sign_extend 24) .cse19) .cse15) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse20 .cse11 .cse12 .cse17 .cse14 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse20 .cse11 .cse12 .cse13 .cse17 .cse14 .cse18)))) [2023-12-24 16:40:03,023 INFO L899 garLoopResultBuilder]: For program point L97-9(line 97) no Hoare annotation was computed. [2023-12-24 16:40:03,023 INFO L895 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: (let ((.cse12 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32)))))) (let ((.cse1 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse2 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse3 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse4 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse5 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse6 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse7 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse8 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse9 (bvsle .cse12 (_ bv16383 32))) (.cse10 (bvsge .cse12 (_ bv8191 32))) (.cse11 (= currentRoundingMode roundNearestTiesToEven)) (.cse0 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (or (and (= ((_ sign_extend 16) (_ bv64 16)) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) .cse9 .cse10 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse0 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse11 (= ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))))) [2023-12-24 16:40:03,023 INFO L899 garLoopResultBuilder]: For program point L114-1(line 114) no Hoare annotation was computed. [2023-12-24 16:40:03,023 INFO L899 garLoopResultBuilder]: For program point L81(lines 81 85) no Hoare annotation was computed. [2023-12-24 16:40:03,023 INFO L899 garLoopResultBuilder]: For program point L81-2(lines 76 86) no Hoare annotation was computed. [2023-12-24 16:40:03,024 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 71) no Hoare annotation was computed. [2023-12-24 16:40:03,024 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 65 71) no Hoare annotation was computed. [2023-12-24 16:40:03,024 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 16:40:03,024 INFO L895 garLoopResultBuilder]: At program point L115(line 115) the Hoare annotation is: (let ((.cse12 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32)))))) (let ((.cse1 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse2 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse3 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse4 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse5 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse6 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse7 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse8 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse9 (bvsle .cse12 (_ bv16383 32))) (.cse10 (bvsge .cse12 (_ bv8191 32))) (.cse11 (= currentRoundingMode roundNearestTiesToEven)) (.cse0 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (or (and (= ((_ sign_extend 16) (_ bv64 16)) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) .cse9 .cse10 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse0 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse11 (= ((_ sign_extend 16) ((_ extract 15 0) .cse0)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))))) [2023-12-24 16:40:03,024 INFO L899 garLoopResultBuilder]: For program point L115-1(line 115) no Hoare annotation was computed. [2023-12-24 16:40:03,024 INFO L895 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse10 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse0 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse1 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse2 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse3 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse4 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse5 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse6 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse7 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse9 (= ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32))) |ULTIMATE.start_updateVariables_#t~mem69#1|)) (.cse8 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)))) (.cse11 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= .cse8 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) .cse9 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse10 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse11 (= ((_ sign_extend 16) ((_ extract 15 0) .cse10)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))) (and (= ((_ sign_extend 16) (_ bv64 16)) .cse10) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (not (bvsgt .cse8 (bvshl ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))))) .cse11 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) [2023-12-24 16:40:03,024 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-12-24 16:40:03,024 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 70) no Hoare annotation was computed. [2023-12-24 16:40:03,025 INFO L895 garLoopResultBuilder]: At program point L132-2(lines 132 138) the Hoare annotation is: (let ((.cse17 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse3 (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)) (.cse2 ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset))) (.cse21 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32))))) (.cse20 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset))))) (let ((.cse18 (exists ((|v_ULTIMATE.start_step_#t~mem15#1_47| (_ BitVec 8))) (not (bvsge ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem15#1_47|) (bvxor .cse21 .cse20))))) (.cse0 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse1 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse4 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse5 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse6 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse7 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse8 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse9 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse10 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset))))) (.cse11 (= ((_ zero_extend 16) ((_ extract 15 0) (bvadd ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#13| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) .cse3))) ((_ zero_extend 24) .cse2)))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset))))) (.cse12 (bvsle .cse21 (_ bv16383 32))) (.cse13 (bvsge .cse21 (_ bv8191 32))) (.cse19 (not (bvsgt .cse20 (bvshl ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset))))))) (.cse14 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse17 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66)))))) (.cse15 (= currentRoundingMode roundNearestTiesToEven)) (.cse16 (= ((_ sign_extend 16) ((_ extract 15 0) .cse17)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))) (or (and .cse0 .cse1 (= ((_ sign_extend 24) .cse2) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ((_ sign_extend 16) (_ bv64 16)) .cse17) .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse12 .cse13 .cse19 .cse15 (= ((_ sign_extend 24) (_ bv2 8)) .cse3)) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14 .cse15 .cse16)))) [2023-12-24 16:40:03,025 INFO L899 garLoopResultBuilder]: For program point L132-3(lines 132 138) no Hoare annotation was computed. [2023-12-24 16:40:03,025 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (let ((.cse13 ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32))))) (let ((.cse0 (= .cse13 |ULTIMATE.start_updateVariables_#t~mem70#1|)) (.cse2 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse3 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse4 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse5 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse6 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse7 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse8 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse9 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse11 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)))) (.cse10 (bvsge ((_ sign_extend 16) .cse13) (_ bv8191 32))) (.cse12 (= currentRoundingMode roundNearestTiesToEven)) (.cse1 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (or (and .cse0 (= ((_ sign_extend 16) (_ bv64 16)) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (bvsgt .cse11 (bvshl ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))))) .cse12 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= .cse11 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#16| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) .cse10 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse1 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse12 (= ((_ sign_extend 16) ((_ extract 15 0) .cse1)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))))) [2023-12-24 16:40:03,025 INFO L899 garLoopResultBuilder]: For program point L100-1(line 100) no Hoare annotation was computed. [2023-12-24 16:40:03,025 INFO L895 garLoopResultBuilder]: At program point L117(line 117) the Hoare annotation is: (let ((.cse12 ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| (_ bv9 32)) (_ bv0 32)))))) (let ((.cse10 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse0 (= ((_ extract 7 0) (select (select |#memory_int#17| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset)) (_ bv0 8))) (.cse1 (= |~#var_1_7~0.base| (_ bv9 32))) (.cse2 (= ~var_1_21_Pointer~0.base |~#var_1_21~0.base|)) (.cse3 (= ~var_1_7_Pointer~0.base (_ bv9 32))) (.cse4 (= ~var_1_21_Pointer~0.offset |~#var_1_21~0.offset|)) (.cse5 (= (_ bv0 32) |~#var_1_7~0.offset|)) (.cse6 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#18| ~var_1_21_Pointer~0.base) ~var_1_21_Pointer~0.offset))) (_ bv0 32))) (.cse7 (= ~var_1_7_Pointer~0.offset (_ bv0 32))) (.cse8 (bvsle .cse12 (_ bv16383 32))) (.cse9 (bvsge .cse12 (_ bv8191 32))) (.cse11 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((v_arrayElimCell_66 (_ BitVec 32))) (= .cse10 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) v_arrayElimCell_66))))) .cse11 (= ((_ sign_extend 16) ((_ extract 15 0) .cse10)) (select (select |#memory_int#14| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))) (and (= ((_ sign_extend 16) (_ bv64 16)) .cse10) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 (= ((_ sign_extend 24) (_ bv2 8)) (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)))))) [2023-12-24 16:40:03,026 INFO L899 garLoopResultBuilder]: For program point L117-1(line 117) no Hoare annotation was computed. [2023-12-24 16:40:03,028 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:40:03,030 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 16:40:03,041 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#17[~var_1_20_Pointer~0!base][~var_1_20_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,048 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,048 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,048 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#18[~var_1_21_Pointer~0!base][~var_1_21_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,048 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,048 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#16[~var_1_19_Pointer~0!base][~var_1_19_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,048 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#13[~var_1_16_Pointer~0!base][~var_1_16_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,049 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,049 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,049 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,049 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated [2023-12-24 16:40:03,049 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated [2023-12-24 16:40:03,049 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_66 : bv32 :: #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] == ~sign_extend~32~8(~zero_extend~16~8(v_arrayElimCell_66[7:0]))) could not be translated [2023-12-24 16:40:03,049 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 16:40:03,049 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#14[~var_1_17_Pointer~0!base][~var_1_17_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#17[~var_1_20_Pointer~0!base][~var_1_20_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#18[~var_1_21_Pointer~0!base][~var_1_21_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_step_#t~mem15#1_47 : bv8 :: !~bvsge~32(~zero_extend~32~16(v_ULTIMATE.start_step_#t~mem15#1_47), ~bvxor~32(~sign_extend~32~8(#memory_int#6[9bv32][0bv32][15:0]), ~sign_extend~32~8(#memory_int#15[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset][7:0])))) could not be translated [2023-12-24 16:40:03,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated [2023-12-24 16:40:03,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated [2023-12-24 16:40:03,050 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 16:40:03,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#17[~var_1_20_Pointer~0!base][~var_1_20_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#18[~var_1_21_Pointer~0!base][~var_1_21_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,051 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#16[~var_1_19_Pointer~0!base][~var_1_19_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_step_#t~mem15#1_47 : bv8 :: !~bvsge~32(~zero_extend~32~16(v_ULTIMATE.start_step_#t~mem15#1_47), ~bvxor~32(~sign_extend~32~8(#memory_int#6[9bv32][0bv32][15:0]), ~sign_extend~32~8(#memory_int#15[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset][7:0])))) could not be translated [2023-12-24 16:40:03,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated [2023-12-24 16:40:03,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated [2023-12-24 16:40:03,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_66 : bv32 :: #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] == ~sign_extend~32~8(~zero_extend~16~8(v_arrayElimCell_66[7:0]))) could not be translated [2023-12-24 16:40:03,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 16:40:03,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#14[~var_1_17_Pointer~0!base][~var_1_17_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,052 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#17[~var_1_20_Pointer~0!base][~var_1_20_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#18[~var_1_21_Pointer~0!base][~var_1_21_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#16[~var_1_19_Pointer~0!base][~var_1_19_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#13[~var_1_16_Pointer~0!base][~var_1_16_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,053 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,054 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,054 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated [2023-12-24 16:40:03,054 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated [2023-12-24 16:40:03,054 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,054 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,054 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,054 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_66 : bv32 :: #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] == ~sign_extend~32~8(~zero_extend~16~8(v_arrayElimCell_66[7:0]))) could not be translated [2023-12-24 16:40:03,054 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 16:40:03,054 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,055 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#14[~var_1_17_Pointer~0!base][~var_1_17_Pointer~0!offset] could not be translated [2023-12-24 16:40:03,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 04:40:03 BoogieIcfgContainer [2023-12-24 16:40:03,055 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 16:40:03,056 INFO L158 Benchmark]: Toolchain (without parser) took 335660.08ms. Allocated memory was 199.2MB in the beginning and 796.9MB in the end (delta: 597.7MB). Free memory was 156.1MB in the beginning and 372.6MB in the end (delta: -216.5MB). Peak memory consumption was 476.2MB. Max. memory is 8.0GB. [2023-12-24 16:40:03,056 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 199.2MB. Free memory is still 156.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 16:40:03,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.08ms. Allocated memory is still 199.2MB. Free memory was 155.8MB in the beginning and 140.4MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-24 16:40:03,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.30ms. Allocated memory is still 199.2MB. Free memory was 140.4MB in the beginning and 136.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-24 16:40:03,056 INFO L158 Benchmark]: Boogie Preprocessor took 93.98ms. Allocated memory is still 199.2MB. Free memory was 136.9MB in the beginning and 129.2MB in the end (delta: 7.7MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-24 16:40:03,056 INFO L158 Benchmark]: RCFGBuilder took 1346.65ms. Allocated memory is still 199.2MB. Free memory was 128.9MB in the beginning and 138.9MB in the end (delta: -10.0MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-24 16:40:03,057 INFO L158 Benchmark]: TraceAbstraction took 333845.57ms. Allocated memory was 199.2MB in the beginning and 796.9MB in the end (delta: 597.7MB). Free memory was 137.8MB in the beginning and 372.6MB in the end (delta: -234.8MB). Peak memory consumption was 456.3MB. Max. memory is 8.0GB. [2023-12-24 16:40:03,057 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.16ms. Allocated memory is still 199.2MB. Free memory is still 156.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 296.08ms. Allocated memory is still 199.2MB. Free memory was 155.8MB in the beginning and 140.4MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.30ms. Allocated memory is still 199.2MB. Free memory was 140.4MB in the beginning and 136.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 93.98ms. Allocated memory is still 199.2MB. Free memory was 136.9MB in the beginning and 129.2MB in the end (delta: 7.7MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1346.65ms. Allocated memory is still 199.2MB. Free memory was 128.9MB in the beginning and 138.9MB in the end (delta: -10.0MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 333845.57ms. Allocated memory was 199.2MB in the beginning and 796.9MB in the end (delta: 597.7MB). Free memory was 137.8MB in the beginning and 372.6MB in the end (delta: -234.8MB). Peak memory consumption was 456.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#17[~var_1_20_Pointer~0!base][~var_1_20_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#18[~var_1_21_Pointer~0!base][~var_1_21_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#16[~var_1_19_Pointer~0!base][~var_1_19_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#13[~var_1_16_Pointer~0!base][~var_1_16_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_66 : bv32 :: #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] == ~sign_extend~32~8(~zero_extend~16~8(v_arrayElimCell_66[7:0]))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#14[~var_1_17_Pointer~0!base][~var_1_17_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#17[~var_1_20_Pointer~0!base][~var_1_20_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#18[~var_1_21_Pointer~0!base][~var_1_21_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_step_#t~mem15#1_47 : bv8 :: !~bvsge~32(~zero_extend~32~16(v_ULTIMATE.start_step_#t~mem15#1_47), ~bvxor~32(~sign_extend~32~8(#memory_int#6[9bv32][0bv32][15:0]), ~sign_extend~32~8(#memory_int#15[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset][7:0])))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#17[~var_1_20_Pointer~0!base][~var_1_20_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#18[~var_1_21_Pointer~0!base][~var_1_21_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#16[~var_1_19_Pointer~0!base][~var_1_19_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_step_#t~mem15#1_47 : bv8 :: !~bvsge~32(~zero_extend~32~16(v_ULTIMATE.start_step_#t~mem15#1_47), ~bvxor~32(~sign_extend~32~8(#memory_int#6[9bv32][0bv32][15:0]), ~sign_extend~32~8(#memory_int#15[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset][7:0])))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_66 : bv32 :: #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] == ~sign_extend~32~8(~zero_extend~16~8(v_arrayElimCell_66[7:0]))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#14[~var_1_17_Pointer~0!base][~var_1_17_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#17[~var_1_20_Pointer~0!base][~var_1_20_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#18[~var_1_21_Pointer~0!base][~var_1_21_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#16[~var_1_19_Pointer~0!base][~var_1_19_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#13[~var_1_16_Pointer~0!base][~var_1_16_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[9bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_66 : bv32 :: #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] == ~sign_extend~32~8(~zero_extend~16~8(v_arrayElimCell_66[7:0]))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#14[~var_1_17_Pointer~0!base][~var_1_17_Pointer~0!offset] could not be translated * 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: 19]: 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 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 333.8s, OverallIterations: 27, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 61.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 77.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6861 SdHoareTripleChecker+Valid, 42.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6861 mSDsluCounter, 20570 SdHoareTripleChecker+Invalid, 39.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15859 mSDsCounter, 993 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3506 IncrementalHoareTripleChecker+Invalid, 4499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 993 mSolverCounterUnsat, 4711 mSDtfsCounter, 3506 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6857 GetRequests, 6400 SyntacticMatches, 5 SemanticMatches, 452 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 2045 ImplicationChecksByTransitivity, 94.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1309occurred in iteration=22, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 2549 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 1754 PreInvPairs, 2029 NumberOfFragments, 5398 HoareAnnotationTreeSize, 1754 FormulaSimplifications, 427451 FormulaSimplificationTreeSizeReduction, 16.2s HoareSimplificationTime, 22 FormulaSimplificationsInter, 753823 FormulaSimplificationTreeSizeReductionInter, 60.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 53.2s SatisfiabilityAnalysisTime, 128.6s InterpolantComputationTime, 4567 NumberOfCodeBlocks, 4567 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 6645 ConstructedInterpolants, 117 QuantifiedInterpolants, 108678 SizeOfPredicates, 453 NumberOfNonLiveVariables, 12352 ConjunctsInSsa, 446 ConjunctsInUnsatCore, 41 InterpolantComputations, 26 PerfectInterpolantSequences, 27649/31160 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 1 specifications checked. All of them hold - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((null & 127) == 0) && ((null & 127) <= 0)) && ((null & 127) == (null & 127))) && (((((null & 32767) + -((null & 127))) % 4294967296) & 32767) == (null & 32767))) && ((null & 32767) <= 16383)) && ((null & 32767) >= 8191)) || ((((((null & 127) == 0) && ((null & 127) <= 0)) && ((null & 32767) <= 16383)) && ((null & 32767) >= 8191)) && !(((null & 127) > ((null & 32767) << (null & 32767)))))) || ((((((null & 127) == 0) && ((null & 127) <= 0)) && ((null & 127) == (null & 127))) && ((null & 32767) <= 16383)) && ((null & 32767) >= 8191))) || ((((((((null & 127) == 0) && ((null & 127) <= 0)) && ((null & 127) == (null & 127))) && (((((null & 32767) + -((null & 127))) % 4294967296) & 32767) == (null & 32767))) && ((null & 32767) <= 16383)) && ((null & 32767) >= 8191)) && !(((null & 127) > ((null & 32767) << (null & 32767)))))) RESULT: Ultimate proved your program to be correct! [2023-12-24 16:40:03,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...