/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-ap_file-48.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 15:04:31,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 15:04:31,107 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 15:04:31,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 15:04:31,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 15:04:31,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 15:04:31,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 15:04:31,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 15:04:31,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 15:04:31,160 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 15:04:31,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 15:04:31,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 15:04:31,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 15:04:31,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 15:04:31,163 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 15:04:31,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 15:04:31,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 15:04:31,164 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 15:04:31,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 15:04:31,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 15:04:31,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 15:04:31,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 15:04:31,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 15:04:31,167 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 15:04:31,167 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 15:04:31,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 15:04:31,167 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 15:04:31,168 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 15:04:31,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 15:04:31,168 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 15:04:31,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 15:04:31,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 15:04:31,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 15:04:31,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 15:04:31,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 15:04:31,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 15:04:31,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 15:04:31,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 15:04:31,171 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 15:04:31,171 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 15:04:31,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 15:04:31,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 15:04:31,171 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 15:04:31,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 15:04:31,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 15:04:31,172 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 15:04:31,172 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 15:04:31,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 15:04:31,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 15:04:31,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 15:04:31,441 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 15:04:31,441 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 15:04:31,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-48.i [2023-12-24 15:04:32,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 15:04:32,793 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 15:04:32,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-48.i [2023-12-24 15:04:32,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b33fb6fd/125bf56794c9411b9c1ca4d8a5cfc1b9/FLAG75c64515d [2023-12-24 15:04:32,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b33fb6fd/125bf56794c9411b9c1ca4d8a5cfc1b9 [2023-12-24 15:04:32,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 15:04:32,817 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 15:04:32,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 15:04:32,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 15:04:32,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 15:04:32,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 03:04:32" (1/1) ... [2023-12-24 15:04:32,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8e5dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:04:32, skipping insertion in model container [2023-12-24 15:04:32,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 03:04:32" (1/1) ... [2023-12-24 15:04:32,873 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 15:04:33,019 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-ap_file-48.i[917,930] [2023-12-24 15:04:33,078 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 15:04:33,094 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 15:04:33,103 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-ap_file-48.i[917,930] [2023-12-24 15:04:33,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 15:04:33,170 INFO L206 MainTranslator]: Completed translation [2023-12-24 15:04:33,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:04:33 WrapperNode [2023-12-24 15:04:33,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 15:04:33,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 15:04:33,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 15:04:33,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 15:04:33,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:04:33" (1/1) ... [2023-12-24 15:04:33,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:04:33" (1/1) ... [2023-12-24 15:04:33,249 INFO L138 Inliner]: procedures = 33, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 522 [2023-12-24 15:04:33,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 15:04:33,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 15:04:33,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 15:04:33,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 15:04:33,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:04:33" (1/1) ... [2023-12-24 15:04:33,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:04:33" (1/1) ... [2023-12-24 15:04:33,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:04:33" (1/1) ... [2023-12-24 15:04:33,290 INFO L175 MemorySlicer]: Split 143 memory accesses to 6 slices as follows [2, 15, 53, 5, 65, 3]. 45 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 2, 6, 1, 9, 1]. The 23 writes are split as follows [0, 3, 8, 1, 10, 1]. [2023-12-24 15:04:33,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:04:33" (1/1) ... [2023-12-24 15:04:33,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:04:33" (1/1) ... [2023-12-24 15:04:33,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:04:33" (1/1) ... [2023-12-24 15:04:33,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:04:33" (1/1) ... [2023-12-24 15:04:33,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:04:33" (1/1) ... [2023-12-24 15:04:33,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:04:33" (1/1) ... [2023-12-24 15:04:33,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 15:04:33,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 15:04:33,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 15:04:33,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 15:04:33,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:04:33" (1/1) ... [2023-12-24 15:04:33,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 15:04:33,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 15:04:33,412 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 15:04:33,440 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 15:04:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 15:04:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 15:04:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 15:04:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 15:04:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 15:04:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 15:04:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-24 15:04:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 15:04:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 15:04:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 15:04:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 15:04:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 15:04:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-24 15:04:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 15:04:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 15:04:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-24 15:04:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-24 15:04:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-24 15:04:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-24 15:04:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-12-24 15:04:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-12-24 15:04:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2023-12-24 15:04:33,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2023-12-24 15:04:33,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2023-12-24 15:04:33,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2023-12-24 15:04:33,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 15:04:33,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 15:04:33,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 15:04:33,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-24 15:04:33,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-24 15:04:33,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-24 15:04:33,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-12-24 15:04:33,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-12-24 15:04:33,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2023-12-24 15:04:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2023-12-24 15:04:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2023-12-24 15:04:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2023-12-24 15:04:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-12-24 15:04:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-12-24 15:04:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2023-12-24 15:04:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2023-12-24 15:04:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2023-12-24 15:04:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2023-12-24 15:04:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 15:04:33,455 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 15:04:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 15:04:33,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 15:04:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 15:04:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 15:04:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 15:04:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 15:04:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 15:04:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-24 15:04:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 15:04:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 15:04:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 15:04:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-24 15:04:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-24 15:04:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-24 15:04:33,661 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 15:04:33,662 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 15:04:34,968 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 15:04:35,011 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 15:04:35,011 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 15:04:35,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 03:04:35 BoogieIcfgContainer [2023-12-24 15:04:35,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 15:04:35,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 15:04:35,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 15:04:35,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 15:04:35,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 03:04:32" (1/3) ... [2023-12-24 15:04:35,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21847f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 03:04:35, skipping insertion in model container [2023-12-24 15:04:35,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 03:04:33" (2/3) ... [2023-12-24 15:04:35,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21847f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 03:04:35, skipping insertion in model container [2023-12-24 15:04:35,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 03:04:35" (3/3) ... [2023-12-24 15:04:35,020 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-48.i [2023-12-24 15:04:35,053 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 15:04:35,053 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 15:04:35,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 15:04:35,102 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;@5bcb3025, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 15:04:35,102 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 15:04:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 15:04:35,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-24 15:04:35,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:04:35,134 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:04:35,135 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:04:35,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:04:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1675232115, now seen corresponding path program 1 times [2023-12-24 15:04:35,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:04:35,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109302919] [2023-12-24 15:04:35,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:04:35,158 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 15:04:35,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:04:35,160 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 15:04:35,161 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 15:04:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:04:35,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 15:04:35,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:04:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2023-12-24 15:04:35,643 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:04:35,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:04:35,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109302919] [2023-12-24 15:04:35,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109302919] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:04:35,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:04:35,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 15:04:35,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755960760] [2023-12-24 15:04:35,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:04:35,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 15:04:35,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:04:35,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 15:04:35,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 15:04:35,678 INFO L87 Difference]: Start difference. First operand has 111 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-24 15:04:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:04:35,728 INFO L93 Difference]: Finished difference Result 219 states and 351 transitions. [2023-12-24 15:04:35,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 15:04:35,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2023-12-24 15:04:35,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:04:35,737 INFO L225 Difference]: With dead ends: 219 [2023-12-24 15:04:35,737 INFO L226 Difference]: Without dead ends: 109 [2023-12-24 15:04:35,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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 15:04:35,743 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:04:35,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:04:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-24 15:04:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-12-24 15:04:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 15:04:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2023-12-24 15:04:35,785 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 163 [2023-12-24 15:04:35,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:04:35,786 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2023-12-24 15:04:35,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-24 15:04:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2023-12-24 15:04:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-24 15:04:35,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:04:35,790 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:04:35,803 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 (2)] Ended with exit code 0 [2023-12-24 15:04:36,000 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 15:04:36,001 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:04:36,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:04:36,002 INFO L85 PathProgramCache]: Analyzing trace with hash -487796941, now seen corresponding path program 1 times [2023-12-24 15:04:36,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:04:36,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151391848] [2023-12-24 15:04:36,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:04:36,003 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 15:04:36,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:04:36,007 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 15:04:36,011 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 15:04:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:04:36,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 15:04:36,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:04:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2023-12-24 15:04:36,488 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:04:36,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:04:36,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151391848] [2023-12-24 15:04:36,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151391848] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:04:36,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:04:36,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 15:04:36,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071178465] [2023-12-24 15:04:36,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:04:36,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 15:04:36,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:04:36,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 15:04:36,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 15:04:36,492 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-24 15:04:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:04:36,602 INFO L93 Difference]: Finished difference Result 223 states and 326 transitions. [2023-12-24 15:04:36,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 15:04:36,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2023-12-24 15:04:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:04:36,607 INFO L225 Difference]: With dead ends: 223 [2023-12-24 15:04:36,607 INFO L226 Difference]: Without dead ends: 115 [2023-12-24 15:04:36,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 15:04:36,611 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 10 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:04:36,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 457 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:04:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-24 15:04:36,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2023-12-24 15:04:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 15:04:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2023-12-24 15:04:36,624 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 163 [2023-12-24 15:04:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:04:36,625 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2023-12-24 15:04:36,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-24 15:04:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2023-12-24 15:04:36,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-24 15:04:36,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:04:36,628 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:04:36,641 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 15:04:36,832 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 15:04:36,833 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:04:36,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:04:36,833 INFO L85 PathProgramCache]: Analyzing trace with hash -873659343, now seen corresponding path program 1 times [2023-12-24 15:04:36,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:04:36,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555166508] [2023-12-24 15:04:36,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:04:36,835 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 15:04:36,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:04:36,836 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 15:04:36,840 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 15:04:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:04:37,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 15:04:37,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:04:37,822 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-12-24 15:04:37,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 59 [2023-12-24 15:04:37,851 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-24 15:04:37,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2023-12-24 15:04:37,941 INFO L349 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2023-12-24 15:04:37,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 25 [2023-12-24 15:04:37,974 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 17 treesize of output 9 [2023-12-24 15:04:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 19 proven. 137 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-24 15:04:37,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:04:38,399 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2023-12-24 15:04:38,400 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 22 treesize of output 21 [2023-12-24 15:04:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-24 15:04:38,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:04:38,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555166508] [2023-12-24 15:04:38,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555166508] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 15:04:38,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:04:38,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-24 15:04:38,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639893882] [2023-12-24 15:04:38,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:04:38,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 15:04:38,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:04:38,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 15:04:38,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-24 15:04:38,433 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 14 states, 12 states have (on average 6.416666666666667) internal successors, (77), 14 states have internal predecessors, (77), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2023-12-24 15:04:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:04:39,847 INFO L93 Difference]: Finished difference Result 380 states and 540 transitions. [2023-12-24 15:04:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-24 15:04:39,848 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.416666666666667) internal successors, (77), 14 states have internal predecessors, (77), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) Word has length 163 [2023-12-24 15:04:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:04:39,850 INFO L225 Difference]: With dead ends: 380 [2023-12-24 15:04:39,850 INFO L226 Difference]: Without dead ends: 270 [2023-12-24 15:04:39,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2023-12-24 15:04:39,853 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 608 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 15:04:39,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1205 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 15:04:39,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-12-24 15:04:39,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 117. [2023-12-24 15:04:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 15:04:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2023-12-24 15:04:39,896 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 163 [2023-12-24 15:04:39,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:04:39,897 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2023-12-24 15:04:39,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.416666666666667) internal successors, (77), 14 states have internal predecessors, (77), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2023-12-24 15:04:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2023-12-24 15:04:39,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-24 15:04:39,903 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:04:39,903 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:04:39,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 15:04:40,117 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 15:04:40,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:04:40,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:04:40,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1427163247, now seen corresponding path program 1 times [2023-12-24 15:04:40,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:04:40,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603367954] [2023-12-24 15:04:40,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:04:40,120 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 15:04:40,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:04:40,137 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 15:04:40,168 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 15:04:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:04:40,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 15:04:40,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:04:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-24 15:04:40,570 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:04:40,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:04:40,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603367954] [2023-12-24 15:04:40,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603367954] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:04:40,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:04:40,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:04:40,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062025706] [2023-12-24 15:04:40,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:04:40,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:04:40,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:04:40,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:04:40,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 15:04:40,575 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 15:04:40,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:04:40,669 INFO L93 Difference]: Finished difference Result 254 states and 361 transitions. [2023-12-24 15:04:40,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 15:04:40,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-12-24 15:04:40,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:04:40,672 INFO L225 Difference]: With dead ends: 254 [2023-12-24 15:04:40,673 INFO L226 Difference]: Without dead ends: 138 [2023-12-24 15:04:40,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 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 15:04:40,674 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 46 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:04:40,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 598 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:04:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-24 15:04:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121. [2023-12-24 15:04:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 97 states have internal predecessors, (128), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 15:04:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 170 transitions. [2023-12-24 15:04:40,693 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 170 transitions. Word has length 163 [2023-12-24 15:04:40,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:04:40,694 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 170 transitions. [2023-12-24 15:04:40,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 15:04:40,694 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 170 transitions. [2023-12-24 15:04:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-24 15:04:40,696 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:04:40,697 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:04:40,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 15:04:40,907 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 15:04:40,907 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:04:40,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:04:40,908 INFO L85 PathProgramCache]: Analyzing trace with hash 617816621, now seen corresponding path program 1 times [2023-12-24 15:04:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:04:40,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455096270] [2023-12-24 15:04:40,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:04:40,909 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 15:04:40,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:04:40,910 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 15:04:40,911 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 15:04:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:04:41,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 15:04:41,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:04:41,289 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-24 15:04:41,289 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:04:41,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:04:41,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455096270] [2023-12-24 15:04:41,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455096270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:04:41,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:04:41,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 15:04:41,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697492902] [2023-12-24 15:04:41,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:04:41,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 15:04:41,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:04:41,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 15:04:41,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 15:04:41,292 INFO L87 Difference]: Start difference. First operand 121 states and 170 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 15:04:41,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:04:41,397 INFO L93 Difference]: Finished difference Result 261 states and 366 transitions. [2023-12-24 15:04:41,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 15:04:41,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-12-24 15:04:41,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:04:41,399 INFO L225 Difference]: With dead ends: 261 [2023-12-24 15:04:41,399 INFO L226 Difference]: Without dead ends: 141 [2023-12-24 15:04:41,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-24 15:04:41,401 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 49 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:04:41,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 741 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:04:41,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-24 15:04:41,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2023-12-24 15:04:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 15:04:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2023-12-24 15:04:41,415 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 172 transitions. Word has length 163 [2023-12-24 15:04:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:04:41,416 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 172 transitions. [2023-12-24 15:04:41,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 15:04:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 172 transitions. [2023-12-24 15:04:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-24 15:04:41,418 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:04:41,418 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:04:41,431 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 15:04:41,628 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 15:04:41,629 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:04:41,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:04:41,629 INFO L85 PathProgramCache]: Analyzing trace with hash 675074923, now seen corresponding path program 1 times [2023-12-24 15:04:41,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:04:41,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427134910] [2023-12-24 15:04:41,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:04:41,630 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 15:04:41,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:04:41,633 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 15:04:41,644 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 15:04:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:04:41,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 15:04:41,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:04:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-24 15:04:42,013 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:04:42,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:04:42,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427134910] [2023-12-24 15:04:42,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427134910] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:04:42,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:04:42,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 15:04:42,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190217976] [2023-12-24 15:04:42,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:04:42,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 15:04:42,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:04:42,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 15:04:42,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 15:04:42,016 INFO L87 Difference]: Start difference. First operand 123 states and 172 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 15:04:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:04:42,177 INFO L93 Difference]: Finished difference Result 264 states and 366 transitions. [2023-12-24 15:04:42,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 15:04:42,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-12-24 15:04:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:04:42,180 INFO L225 Difference]: With dead ends: 264 [2023-12-24 15:04:42,180 INFO L226 Difference]: Without dead ends: 142 [2023-12-24 15:04:42,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-12-24 15:04:42,182 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 40 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:04:42,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 878 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:04:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-24 15:04:42,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2023-12-24 15:04:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.306930693069307) internal successors, (132), 101 states have internal predecessors, (132), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 15:04:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 174 transitions. [2023-12-24 15:04:42,200 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 174 transitions. Word has length 163 [2023-12-24 15:04:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:04:42,202 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 174 transitions. [2023-12-24 15:04:42,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 15:04:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 174 transitions. [2023-12-24 15:04:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-24 15:04:42,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:04:42,205 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:04:42,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 15:04:42,415 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 15:04:42,415 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:04:42,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:04:42,416 INFO L85 PathProgramCache]: Analyzing trace with hash 675134505, now seen corresponding path program 1 times [2023-12-24 15:04:42,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:04:42,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167472030] [2023-12-24 15:04:42,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:04:42,417 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 15:04:42,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:04:42,418 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 15:04:42,423 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 15:04:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:04:42,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 15:04:42,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:04:42,852 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 95 treesize of output 41 [2023-12-24 15:04:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-12-24 15:04:42,876 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:04:42,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:04:42,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167472030] [2023-12-24 15:04:42,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167472030] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:04:42,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:04:42,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:04:42,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754298397] [2023-12-24 15:04:42,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:04:42,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 15:04:42,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:04:42,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 15:04:42,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 15:04:42,878 INFO L87 Difference]: Start difference. First operand 125 states and 174 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-24 15:04:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:04:44,028 INFO L93 Difference]: Finished difference Result 255 states and 356 transitions. [2023-12-24 15:04:44,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 15:04:44,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2023-12-24 15:04:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:04:44,030 INFO L225 Difference]: With dead ends: 255 [2023-12-24 15:04:44,030 INFO L226 Difference]: Without dead ends: 131 [2023-12-24 15:04:44,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 15:04:44,031 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 154 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:04:44,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 465 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-24 15:04:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-24 15:04:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2023-12-24 15:04:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 15:04:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2023-12-24 15:04:44,069 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 163 [2023-12-24 15:04:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:04:44,069 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2023-12-24 15:04:44,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-24 15:04:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2023-12-24 15:04:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-24 15:04:44,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:04:44,071 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:04:44,088 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 15:04:44,282 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 15:04:44,283 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:04:44,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:04:44,283 INFO L85 PathProgramCache]: Analyzing trace with hash 169042275, now seen corresponding path program 1 times [2023-12-24 15:04:44,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:04:44,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924969914] [2023-12-24 15:04:44,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:04:44,284 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 15:04:44,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:04:44,285 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 15:04:44,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 15:04:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:04:44,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 15:04:44,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:04:44,745 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 95 treesize of output 41 [2023-12-24 15:04:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2023-12-24 15:04:44,769 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:04:44,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:04:44,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924969914] [2023-12-24 15:04:44,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924969914] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:04:44,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:04:44,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:04:44,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201218829] [2023-12-24 15:04:44,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:04:44,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 15:04:44,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:04:44,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 15:04:44,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 15:04:44,771 INFO L87 Difference]: Start difference. First operand 125 states and 173 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-24 15:04:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:04:46,148 INFO L93 Difference]: Finished difference Result 255 states and 354 transitions. [2023-12-24 15:04:46,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 15:04:46,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 165 [2023-12-24 15:04:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:04:46,149 INFO L225 Difference]: With dead ends: 255 [2023-12-24 15:04:46,150 INFO L226 Difference]: Without dead ends: 131 [2023-12-24 15:04:46,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 15:04:46,151 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 145 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-24 15:04:46,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 464 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-24 15:04:46,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-24 15:04:46,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2023-12-24 15:04:46,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 15:04:46,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 172 transitions. [2023-12-24 15:04:46,166 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 172 transitions. Word has length 165 [2023-12-24 15:04:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:04:46,166 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 172 transitions. [2023-12-24 15:04:46,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-24 15:04:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 172 transitions. [2023-12-24 15:04:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-24 15:04:46,167 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:04:46,167 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:04:46,179 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 15:04:46,378 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 15:04:46,379 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:04:46,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:04:46,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1031486057, now seen corresponding path program 1 times [2023-12-24 15:04:46,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:04:46,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527243974] [2023-12-24 15:04:46,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:04:46,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:04:46,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:04:46,381 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 15:04:46,383 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 15:04:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:04:46,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-24 15:04:46,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:04:47,289 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 15:04:47,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-12-24 15:04:48,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-12-24 15:04:48,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-12-24 15:04:48,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-12-24 15:04:50,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2023-12-24 15:04:50,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:04:50,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 80 [2023-12-24 15:04:50,311 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2023-12-24 15:04:50,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:04:50,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:04:50,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527243974] [2023-12-24 15:04:50,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527243974] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:04:50,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [768005247] [2023-12-24 15:04:50,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:04:50,663 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 15:04:50,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 15:04:50,713 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 15:04:50,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-24 15:04:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:04:52,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-24 15:04:52,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:04:52,757 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 15:04:53,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-12-24 15:04:53,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-12-24 15:04:53,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-12-24 15:04:54,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-12-24 15:04:55,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2023-12-24 15:04:56,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 80 [2023-12-24 15:04:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2023-12-24 15:04:56,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:04:56,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [768005247] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:04:56,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:04:56,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2023-12-24 15:04:56,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871023966] [2023-12-24 15:04:56,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:04:56,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-24 15:04:56,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:04:56,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-24 15:04:56,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2023-12-24 15:04:56,258 INFO L87 Difference]: Start difference. First operand 125 states and 172 transitions. Second operand has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 17 states have internal predecessors, (129), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 6 states have call predecessors, (42), 6 states have call successors, (42) [2023-12-24 15:05:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:05:01,454 INFO L93 Difference]: Finished difference Result 395 states and 543 transitions. [2023-12-24 15:05:01,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 15:05:01,455 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 17 states have internal predecessors, (129), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 6 states have call predecessors, (42), 6 states have call successors, (42) Word has length 167 [2023-12-24 15:05:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:05:01,457 INFO L225 Difference]: With dead ends: 395 [2023-12-24 15:05:01,457 INFO L226 Difference]: Without dead ends: 271 [2023-12-24 15:05:01,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2023-12-24 15:05:01,458 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 735 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-24 15:05:01,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1462 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-12-24 15:05:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-12-24 15:05:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 202. [2023-12-24 15:05:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 158 states have (on average 1.2848101265822784) internal successors, (203), 158 states have internal predecessors, (203), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-24 15:05:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 283 transitions. [2023-12-24 15:05:01,485 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 283 transitions. Word has length 167 [2023-12-24 15:05:01,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:05:01,485 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 283 transitions. [2023-12-24 15:05:01,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 17 states have internal predecessors, (129), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 6 states have call predecessors, (42), 6 states have call successors, (42) [2023-12-24 15:05:01,486 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 283 transitions. [2023-12-24 15:05:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-24 15:05:01,487 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:05:01,487 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:01,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-12-24 15:05:01,702 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 15:05:01,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 15:05:01,892 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:05:01,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:05:01,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1683760753, now seen corresponding path program 1 times [2023-12-24 15:05:01,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:05:01,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115780740] [2023-12-24 15:05:01,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:05:01,894 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 15:05:01,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:05:01,895 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 15:05:01,896 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 15:05:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:05:02,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 15:05:02,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:05:02,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 79 treesize of output 43 [2023-12-24 15:05:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 8 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2023-12-24 15:05:02,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:05:02,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 49 treesize of output 25 [2023-12-24 15:05:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-24 15:05:02,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:05:02,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115780740] [2023-12-24 15:05:02,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115780740] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 15:05:02,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:05:02,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-12-24 15:05:02,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425090084] [2023-12-24 15:05:02,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:05:02,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 15:05:02,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:05:02,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 15:05:02,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-24 15:05:02,590 INFO L87 Difference]: Start difference. First operand 202 states and 283 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2023-12-24 15:05:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:05:04,276 INFO L93 Difference]: Finished difference Result 418 states and 582 transitions. [2023-12-24 15:05:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 15:05:04,277 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) Word has length 169 [2023-12-24 15:05:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:05:04,278 INFO L225 Difference]: With dead ends: 418 [2023-12-24 15:05:04,278 INFO L226 Difference]: Without dead ends: 206 [2023-12-24 15:05:04,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2023-12-24 15:05:04,279 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 155 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-24 15:05:04,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 805 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-24 15:05:04,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-12-24 15:05:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 200. [2023-12-24 15:05:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 156 states have (on average 1.2756410256410255) internal successors, (199), 156 states have internal predecessors, (199), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-24 15:05:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 279 transitions. [2023-12-24 15:05:04,304 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 279 transitions. Word has length 169 [2023-12-24 15:05:04,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:05:04,304 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 279 transitions. [2023-12-24 15:05:04,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2023-12-24 15:05:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 279 transitions. [2023-12-24 15:05:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-24 15:05:04,306 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:05:04,306 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:04,320 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 15:05:04,517 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 15:05:04,517 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:05:04,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:05:04,517 INFO L85 PathProgramCache]: Analyzing trace with hash -624871954, now seen corresponding path program 1 times [2023-12-24 15:05:04,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:05:04,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142701908] [2023-12-24 15:05:04,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:05:04,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:05:04,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:05:04,519 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 15:05:04,524 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 15:05:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:05:05,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-24 15:05:05,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:05:05,341 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 15:05:05,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-12-24 15:05:06,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-12-24 15:05:06,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-12-24 15:05:06,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-12-24 15:05:07,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2023-12-24 15:05:08,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:05:08,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 80 [2023-12-24 15:05:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2023-12-24 15:05:08,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:05:08,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:05:08,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142701908] [2023-12-24 15:05:08,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142701908] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:05:08,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [727628635] [2023-12-24 15:05:08,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:05:08,566 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 15:05:08,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 15:05:08,567 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 15:05:08,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-12-24 15:05:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:05:10,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-24 15:05:10,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:05:12,169 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 15:05:12,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-12-24 15:05:16,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 79 [2023-12-24 15:05:16,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 59 [2023-12-24 15:05:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 20 proven. 360 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2023-12-24 15:05:17,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:05:18,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [727628635] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:05:18,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:05:18,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 23 [2023-12-24 15:05:18,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638211457] [2023-12-24 15:05:18,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:05:18,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 15:05:18,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:05:18,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 15:05:18,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2023-12-24 15:05:18,051 INFO L87 Difference]: Start difference. First operand 200 states and 279 transitions. Second operand has 24 states, 24 states have (on average 5.625) internal successors, (135), 23 states have internal predecessors, (135), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 6 states have call predecessors, (42), 6 states have call successors, (42) [2023-12-24 15:05:44,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 15:05:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:05:45,087 INFO L93 Difference]: Finished difference Result 1121 states and 1518 transitions. [2023-12-24 15:05:45,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-12-24 15:05:45,088 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 23 states have internal predecessors, (135), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 6 states have call predecessors, (42), 6 states have call successors, (42) Word has length 169 [2023-12-24 15:05:45,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:05:45,092 INFO L225 Difference]: With dead ends: 1121 [2023-12-24 15:05:45,092 INFO L226 Difference]: Without dead ends: 922 [2023-12-24 15:05:45,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 352 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=1330, Invalid=8770, Unknown=0, NotChecked=0, Total=10100 [2023-12-24 15:05:45,095 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 2627 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2627 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2023-12-24 15:05:45,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2627 Valid, 2422 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2023-12-24 15:05:45,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2023-12-24 15:05:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 675. [2023-12-24 15:05:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 536 states have (on average 1.2649253731343284) internal successors, (678), 542 states have internal predecessors, (678), 126 states have call successors, (126), 12 states have call predecessors, (126), 12 states have return successors, (126), 120 states have call predecessors, (126), 126 states have call successors, (126) [2023-12-24 15:05:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 930 transitions. [2023-12-24 15:05:45,186 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 930 transitions. Word has length 169 [2023-12-24 15:05:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:05:45,186 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 930 transitions. [2023-12-24 15:05:45,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 23 states have internal predecessors, (135), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 6 states have call predecessors, (42), 6 states have call successors, (42) [2023-12-24 15:05:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 930 transitions. [2023-12-24 15:05:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-24 15:05:45,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:05:45,189 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:45,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-12-24 15:05:45,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-24 15:05:45,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 15:05:45,599 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:05:45,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:05:45,600 INFO L85 PathProgramCache]: Analyzing trace with hash 883760254, now seen corresponding path program 1 times [2023-12-24 15:05:45,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:05:45,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795618757] [2023-12-24 15:05:45,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:05:45,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:05:45,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:05:45,602 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 15:05:45,603 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 15:05:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:05:45,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 15:05:45,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:05:45,927 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-24 15:05:45,927 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:05:45,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:05:45,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795618757] [2023-12-24 15:05:45,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795618757] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:05:45,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:05:45,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:05:45,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654188157] [2023-12-24 15:05:45,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:05:45,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:05:45,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:05:45,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:05:45,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 15:05:45,929 INFO L87 Difference]: Start difference. First operand 675 states and 930 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 15:05:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:05:46,060 INFO L93 Difference]: Finished difference Result 1413 states and 1943 transitions. [2023-12-24 15:05:46,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 15:05:46,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 169 [2023-12-24 15:05:46,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:05:46,069 INFO L225 Difference]: With dead ends: 1413 [2023-12-24 15:05:46,069 INFO L226 Difference]: Without dead ends: 739 [2023-12-24 15:05:46,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 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 15:05:46,071 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 41 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:05:46,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 575 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:05:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2023-12-24 15:05:46,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 687. [2023-12-24 15:05:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 548 states have (on average 1.2591240875912408) internal successors, (690), 554 states have internal predecessors, (690), 126 states have call successors, (126), 12 states have call predecessors, (126), 12 states have return successors, (126), 120 states have call predecessors, (126), 126 states have call successors, (126) [2023-12-24 15:05:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 942 transitions. [2023-12-24 15:05:46,155 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 942 transitions. Word has length 169 [2023-12-24 15:05:46,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:05:46,155 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 942 transitions. [2023-12-24 15:05:46,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 15:05:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 942 transitions. [2023-12-24 15:05:46,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-24 15:05:46,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:05:46,158 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:46,171 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 15:05:46,370 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 15:05:46,371 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:05:46,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:05:46,371 INFO L85 PathProgramCache]: Analyzing trace with hash -841734929, now seen corresponding path program 1 times [2023-12-24 15:05:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:05:46,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760880811] [2023-12-24 15:05:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:05:46,372 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 15:05:46,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:05:46,373 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 15:05:46,374 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 15:05:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:05:46,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-24 15:05:46,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:05:47,132 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 15:05:47,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:05:47,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:05:48,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:05:48,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:05:49,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 57 [2023-12-24 15:05:49,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:05:49,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 78 [2023-12-24 15:05:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 3 proven. 401 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2023-12-24 15:05:49,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:05:49,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:05:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760880811] [2023-12-24 15:05:49,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760880811] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:05:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1207302511] [2023-12-24 15:05:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:05:49,936 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 15:05:49,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 15:05:49,937 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 15:05:49,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-24 15:05:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:05:51,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 15:05:51,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:05:52,233 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 15:05:53,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:05:53,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:05:53,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:05:53,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:05:55,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 57 [2023-12-24 15:05:55,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 78 [2023-12-24 15:05:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 3 proven. 401 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2023-12-24 15:05:55,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:05:56,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1207302511] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:05:56,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:05:56,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2023-12-24 15:05:56,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008759394] [2023-12-24 15:05:56,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:05:56,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-24 15:05:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:05:56,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-24 15:05:56,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2023-12-24 15:05:56,213 INFO L87 Difference]: Start difference. First operand 687 states and 942 transitions. Second operand has 26 states, 24 states have (on average 5.791666666666667) internal successors, (139), 23 states have internal predecessors, (139), 8 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 6 states have call predecessors, (42), 8 states have call successors, (42) [2023-12-24 15:06:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:06:04,688 INFO L93 Difference]: Finished difference Result 1646 states and 2212 transitions. [2023-12-24 15:06:04,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 15:06:04,690 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.791666666666667) internal successors, (139), 23 states have internal predecessors, (139), 8 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 6 states have call predecessors, (42), 8 states have call successors, (42) Word has length 169 [2023-12-24 15:06:04,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:06:04,694 INFO L225 Difference]: With dead ends: 1646 [2023-12-24 15:06:04,694 INFO L226 Difference]: Without dead ends: 960 [2023-12-24 15:06:04,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=424, Invalid=1738, Unknown=0, NotChecked=0, Total=2162 [2023-12-24 15:06:04,697 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 854 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-12-24 15:06:04,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1540 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2023-12-24 15:06:04,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2023-12-24 15:06:04,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 688. [2023-12-24 15:06:04,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 545 states have (on average 1.2532110091743118) internal successors, (683), 551 states have internal predecessors, (683), 126 states have call successors, (126), 16 states have call predecessors, (126), 16 states have return successors, (126), 120 states have call predecessors, (126), 126 states have call successors, (126) [2023-12-24 15:06:04,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 935 transitions. [2023-12-24 15:06:04,793 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 935 transitions. Word has length 169 [2023-12-24 15:06:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:06:04,793 INFO L495 AbstractCegarLoop]: Abstraction has 688 states and 935 transitions. [2023-12-24 15:06:04,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.791666666666667) internal successors, (139), 23 states have internal predecessors, (139), 8 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 6 states have call predecessors, (42), 8 states have call successors, (42) [2023-12-24 15:06:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 935 transitions. [2023-12-24 15:06:04,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-24 15:06:04,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:06:04,796 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:04,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-24 15:06:05,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2023-12-24 15:06:05,208 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 15:06:05,209 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:06:05,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:06:05,209 INFO L85 PathProgramCache]: Analyzing trace with hash 707745611, now seen corresponding path program 1 times [2023-12-24 15:06:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:06:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390125373] [2023-12-24 15:06:05,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:06:05,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:06:05,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:06:05,211 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 15:06:05,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-24 15:06:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:06:05,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 15:06:05,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:06:05,586 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 12 treesize of output 8 [2023-12-24 15:06:05,638 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 34 treesize of output 22 [2023-12-24 15:06:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-24 15:06:05,654 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:06:05,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:06:05,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390125373] [2023-12-24 15:06:05,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390125373] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:06:05,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:06:05,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:06:05,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747220260] [2023-12-24 15:06:05,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:06:05,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:06:05,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:06:05,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:06:05,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 15:06:05,656 INFO L87 Difference]: Start difference. First operand 688 states and 935 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 15:06:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:06:05,972 INFO L93 Difference]: Finished difference Result 1146 states and 1526 transitions. [2023-12-24 15:06:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 15:06:05,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 171 [2023-12-24 15:06:05,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:06:05,978 INFO L225 Difference]: With dead ends: 1146 [2023-12-24 15:06:05,979 INFO L226 Difference]: Without dead ends: 1144 [2023-12-24 15:06:05,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 15:06:05,980 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 88 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 15:06:05,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 709 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 15:06:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2023-12-24 15:06:06,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1132. [2023-12-24 15:06:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 931 states have (on average 1.2610096670247046) internal successors, (1174), 949 states have internal predecessors, (1174), 168 states have call successors, (168), 32 states have call predecessors, (168), 32 states have return successors, (168), 150 states have call predecessors, (168), 168 states have call successors, (168) [2023-12-24 15:06:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1510 transitions. [2023-12-24 15:06:06,134 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1510 transitions. Word has length 171 [2023-12-24 15:06:06,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:06:06,135 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 1510 transitions. [2023-12-24 15:06:06,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 15:06:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1510 transitions. [2023-12-24 15:06:06,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-24 15:06:06,138 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:06:06,138 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:06,147 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 15:06:06,341 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 15:06:06,341 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:06:06,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:06:06,342 INFO L85 PathProgramCache]: Analyzing trace with hash 707805193, now seen corresponding path program 1 times [2023-12-24 15:06:06,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:06:06,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534920285] [2023-12-24 15:06:06,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:06:06,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 15:06:06,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:06:06,344 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 15:06:06,344 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 15:06:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:06:06,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 15:06:06,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:06:07,899 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 15:06:08,024 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 12 treesize of output 8 [2023-12-24 15:06:08,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 15:06:08,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 15:06:08,493 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 15:06:08,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:06:08,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2023-12-24 15:06:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 240 proven. 152 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2023-12-24 15:06:08,670 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:06:08,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:06:08,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534920285] [2023-12-24 15:06:08,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534920285] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:06:08,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [845355622] [2023-12-24 15:06:08,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:06:08,768 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 15:06:08,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 15:06:08,773 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 15:06:08,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-24 15:06:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:06:10,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 15:06:10,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:06:11,291 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 15:06:11,429 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 15:06:11,571 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 12 treesize of output 8 [2023-12-24 15:06:11,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 15:06:11,947 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 15:06:11,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2023-12-24 15:06:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 136 proven. 152 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-12-24 15:06:12,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:06:12,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [845355622] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:06:12,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:06:12,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-12-24 15:06:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833548975] [2023-12-24 15:06:12,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:06:12,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 15:06:12,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:06:12,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 15:06:12,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-12-24 15:06:12,250 INFO L87 Difference]: Start difference. First operand 1132 states and 1510 transitions. Second operand has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 11 states have internal predecessors, (145), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 6 states have call predecessors, (42), 6 states have call successors, (42) [2023-12-24 15:06:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:06:13,384 INFO L93 Difference]: Finished difference Result 2367 states and 3152 transitions. [2023-12-24 15:06:13,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 15:06:13,385 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 11 states have internal predecessors, (145), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 6 states have call predecessors, (42), 6 states have call successors, (42) Word has length 171 [2023-12-24 15:06:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:06:13,390 INFO L225 Difference]: With dead ends: 2367 [2023-12-24 15:06:13,390 INFO L226 Difference]: Without dead ends: 1236 [2023-12-24 15:06:13,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 379 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2023-12-24 15:06:13,395 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 669 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 15:06:13,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 732 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 15:06:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2023-12-24 15:06:13,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1228. [2023-12-24 15:06:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 985 states have (on average 1.2426395939086294) internal successors, (1224), 1003 states have internal predecessors, (1224), 204 states have call successors, (204), 38 states have call predecessors, (204), 38 states have return successors, (204), 186 states have call predecessors, (204), 204 states have call successors, (204) [2023-12-24 15:06:13,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1632 transitions. [2023-12-24 15:06:13,626 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1632 transitions. Word has length 171 [2023-12-24 15:06:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:06:13,627 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 1632 transitions. [2023-12-24 15:06:13,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 11 states have internal predecessors, (145), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 6 states have call predecessors, (42), 6 states have call successors, (42) [2023-12-24 15:06:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1632 transitions. [2023-12-24 15:06:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-24 15:06:13,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:06:13,630 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:13,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2023-12-24 15:06:13,853 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 15:06:14,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 15:06:14,053 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:06:14,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:06:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash 765063495, now seen corresponding path program 1 times [2023-12-24 15:06:14,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:06:14,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641321484] [2023-12-24 15:06:14,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:06:14,054 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 15:06:14,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:06:14,055 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 15:06:14,088 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 15:06:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:06:14,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-24 15:06:14,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:06:15,762 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 12 treesize of output 8 [2023-12-24 15:06:15,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-24 15:06:16,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2023-12-24 15:06:16,410 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 15:06:16,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:06:16,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 43 [2023-12-24 15:06:16,610 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 44 treesize of output 32 [2023-12-24 15:06:16,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:06:16,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 36 [2023-12-24 15:06:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 256 proven. 152 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2023-12-24 15:06:16,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:06:16,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:06:16,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641321484] [2023-12-24 15:06:16,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641321484] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:06:16,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1811328428] [2023-12-24 15:06:16,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:06:16,742 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 15:06:16,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 15:06:16,743 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 15:06:16,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-12-24 15:06:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:06:18,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-24 15:06:18,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:06:19,420 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 12 treesize of output 8 [2023-12-24 15:06:19,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 15:06:19,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 15:06:20,034 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 15:06:20,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2023-12-24 15:06:20,211 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 240 proven. 152 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2023-12-24 15:06:20,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:06:20,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1811328428] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:06:20,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:06:20,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-12-24 15:06:20,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984563079] [2023-12-24 15:06:20,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:06:20,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 15:06:20,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:06:20,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 15:06:20,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-12-24 15:06:20,292 INFO L87 Difference]: Start difference. First operand 1228 states and 1632 transitions. Second operand has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 12 states have internal predecessors, (146), 7 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 7 states have call predecessors, (42), 7 states have call successors, (42) [2023-12-24 15:06:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:06:22,018 INFO L93 Difference]: Finished difference Result 2511 states and 3324 transitions. [2023-12-24 15:06:22,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 15:06:22,019 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 12 states have internal predecessors, (146), 7 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 7 states have call predecessors, (42), 7 states have call successors, (42) Word has length 171 [2023-12-24 15:06:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:06:22,024 INFO L225 Difference]: With dead ends: 2511 [2023-12-24 15:06:22,024 INFO L226 Difference]: Without dead ends: 1284 [2023-12-24 15:06:22,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2023-12-24 15:06:22,027 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 703 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-24 15:06:22,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 744 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-24 15:06:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2023-12-24 15:06:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1276. [2023-12-24 15:06:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1015 states have (on average 1.2315270935960592) internal successors, (1250), 1033 states have internal predecessors, (1250), 216 states have call successors, (216), 44 states have call predecessors, (216), 44 states have return successors, (216), 198 states have call predecessors, (216), 216 states have call successors, (216) [2023-12-24 15:06:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1682 transitions. [2023-12-24 15:06:22,318 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1682 transitions. Word has length 171 [2023-12-24 15:06:22,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:06:22,319 INFO L495 AbstractCegarLoop]: Abstraction has 1276 states and 1682 transitions. [2023-12-24 15:06:22,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 12 states have internal predecessors, (146), 7 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 7 states have call predecessors, (42), 7 states have call successors, (42) [2023-12-24 15:06:22,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1682 transitions. [2023-12-24 15:06:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-24 15:06:22,321 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:06:22,321 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:22,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-12-24 15:06:22,543 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 (21)] Ended with exit code 0 [2023-12-24 15:06:22,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 15:06:22,733 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:06:22,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:06:22,734 INFO L85 PathProgramCache]: Analyzing trace with hash -44283131, now seen corresponding path program 1 times [2023-12-24 15:06:22,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:06:22,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880997180] [2023-12-24 15:06:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:06:22,735 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 15:06:22,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:06:22,736 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 15:06:22,738 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 15:06:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:06:23,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 15:06:23,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:06:24,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-12-24 15:06:24,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:06:24,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 35 [2023-12-24 15:06:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 19 proven. 137 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-24 15:06:24,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:06:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-24 15:06:24,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:06:24,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880997180] [2023-12-24 15:06:24,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880997180] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 15:06:24,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 15:06:24,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2023-12-24 15:06:24,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461092777] [2023-12-24 15:06:24,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:06:24,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 15:06:24,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:06:24,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 15:06:24,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-24 15:06:24,870 INFO L87 Difference]: Start difference. First operand 1276 states and 1682 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 15:06:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:06:25,245 INFO L93 Difference]: Finished difference Result 2808 states and 3689 transitions. [2023-12-24 15:06:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 15:06:25,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 171 [2023-12-24 15:06:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:06:25,254 INFO L225 Difference]: With dead ends: 2808 [2023-12-24 15:06:25,254 INFO L226 Difference]: Without dead ends: 1533 [2023-12-24 15:06:25,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-12-24 15:06:25,257 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 59 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 15:06:25,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 746 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 15:06:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2023-12-24 15:06:25,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1409. [2023-12-24 15:06:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1148 states have (on average 1.2378048780487805) internal successors, (1421), 1166 states have internal predecessors, (1421), 216 states have call successors, (216), 44 states have call predecessors, (216), 44 states have return successors, (216), 198 states have call predecessors, (216), 216 states have call successors, (216) [2023-12-24 15:06:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1853 transitions. [2023-12-24 15:06:25,554 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1853 transitions. Word has length 171 [2023-12-24 15:06:25,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:06:25,556 INFO L495 AbstractCegarLoop]: Abstraction has 1409 states and 1853 transitions. [2023-12-24 15:06:25,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 15:06:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1853 transitions. [2023-12-24 15:06:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-24 15:06:25,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:06:25,559 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:25,575 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 15:06:25,771 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 15:06:25,771 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:06:25,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:06:25,772 INFO L85 PathProgramCache]: Analyzing trace with hash -745347709, now seen corresponding path program 1 times [2023-12-24 15:06:25,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:06:25,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374601700] [2023-12-24 15:06:25,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:06:25,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:06:25,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:06:25,773 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 15:06:25,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-24 15:06:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:06:26,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 15:06:26,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:06:26,165 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 17 treesize of output 13 [2023-12-24 15:06:26,171 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 15:06:26,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:06:26,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 70 [2023-12-24 15:06:26,412 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 26 [2023-12-24 15:06:26,519 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-24 15:06:26,519 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:06:26,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:06:26,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374601700] [2023-12-24 15:06:26,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374601700] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:06:26,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:06:26,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 15:06:26,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339284837] [2023-12-24 15:06:26,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:06:26,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 15:06:26,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:06:26,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 15:06:26,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 15:06:26,521 INFO L87 Difference]: Start difference. First operand 1409 states and 1853 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 15:06:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:06:27,519 INFO L93 Difference]: Finished difference Result 2684 states and 3529 transitions. [2023-12-24 15:06:27,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 15:06:27,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 171 [2023-12-24 15:06:27,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:06:27,526 INFO L225 Difference]: With dead ends: 2684 [2023-12-24 15:06:27,526 INFO L226 Difference]: Without dead ends: 1276 [2023-12-24 15:06:27,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 15:06:27,530 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 101 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 15:06:27,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 681 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 15:06:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2023-12-24 15:06:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1274. [2023-12-24 15:06:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1013 states have (on average 1.2171767028627838) internal successors, (1233), 1031 states have internal predecessors, (1233), 216 states have call successors, (216), 44 states have call predecessors, (216), 44 states have return successors, (216), 198 states have call predecessors, (216), 216 states have call successors, (216) [2023-12-24 15:06:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1665 transitions. [2023-12-24 15:06:27,823 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1665 transitions. Word has length 171 [2023-12-24 15:06:27,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:06:27,823 INFO L495 AbstractCegarLoop]: Abstraction has 1274 states and 1665 transitions. [2023-12-24 15:06:27,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-24 15:06:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1665 transitions. [2023-12-24 15:06:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-24 15:06:27,826 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:06:27,826 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:27,843 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 15:06:28,037 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 15:06:28,037 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:06:28,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:06:28,038 INFO L85 PathProgramCache]: Analyzing trace with hash 729989750, now seen corresponding path program 1 times [2023-12-24 15:06:28,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:06:28,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989720261] [2023-12-24 15:06:28,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:06:28,039 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 15:06:28,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:06:28,040 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 15:06:28,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 (25)] Waiting until timeout for monitored process [2023-12-24 15:06:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:06:28,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 15:06:28,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:06:28,443 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 15:06:28,443 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:06:28,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:06:28,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989720261] [2023-12-24 15:06:28,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989720261] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:06:28,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:06:28,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 15:06:28,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695368317] [2023-12-24 15:06:28,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:06:28,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 15:06:28,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:06:28,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 15:06:28,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 15:06:28,445 INFO L87 Difference]: Start difference. First operand 1274 states and 1665 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-24 15:06:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:06:28,687 INFO L93 Difference]: Finished difference Result 2587 states and 3389 transitions. [2023-12-24 15:06:28,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 15:06:28,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 171 [2023-12-24 15:06:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:06:28,692 INFO L225 Difference]: With dead ends: 2587 [2023-12-24 15:06:28,692 INFO L226 Difference]: Without dead ends: 1314 [2023-12-24 15:06:28,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 15:06:28,695 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 7 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:06:28,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 447 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:06:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2023-12-24 15:06:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1282. [2023-12-24 15:06:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1021 states have (on average 1.2115572967678747) internal successors, (1237), 1039 states have internal predecessors, (1237), 216 states have call successors, (216), 44 states have call predecessors, (216), 44 states have return successors, (216), 198 states have call predecessors, (216), 216 states have call successors, (216) [2023-12-24 15:06:28,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1669 transitions. [2023-12-24 15:06:28,977 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1669 transitions. Word has length 171 [2023-12-24 15:06:28,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:06:28,977 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1669 transitions. [2023-12-24 15:06:28,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-24 15:06:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1669 transitions. [2023-12-24 15:06:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-24 15:06:28,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:06:28,980 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:28,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-24 15:06:29,192 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 15:06:29,193 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:06:29,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:06:29,193 INFO L85 PathProgramCache]: Analyzing trace with hash -251904590, now seen corresponding path program 1 times [2023-12-24 15:06:29,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:06:29,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784265580] [2023-12-24 15:06:29,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:06:29,194 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 15:06:29,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:06:29,195 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 15:06:29,196 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 15:06:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:06:29,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 15:06:29,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:06:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2023-12-24 15:06:29,578 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 15:06:29,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:06:29,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784265580] [2023-12-24 15:06:29,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784265580] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 15:06:29,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 15:06:29,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 15:06:29,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920752468] [2023-12-24 15:06:29,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 15:06:29,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 15:06:29,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:06:29,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 15:06:29,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 15:06:29,580 INFO L87 Difference]: Start difference. First operand 1282 states and 1669 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-24 15:06:29,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:06:29,860 INFO L93 Difference]: Finished difference Result 2579 states and 3361 transitions. [2023-12-24 15:06:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 15:06:29,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 171 [2023-12-24 15:06:29,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:06:29,865 INFO L225 Difference]: With dead ends: 2579 [2023-12-24 15:06:29,865 INFO L226 Difference]: Without dead ends: 1298 [2023-12-24 15:06:29,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 15:06:29,867 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 7 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 15:06:29,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 447 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 15:06:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2023-12-24 15:06:30,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1282. [2023-12-24 15:06:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1021 states have (on average 1.207639569049951) internal successors, (1233), 1039 states have internal predecessors, (1233), 216 states have call successors, (216), 44 states have call predecessors, (216), 44 states have return successors, (216), 198 states have call predecessors, (216), 216 states have call successors, (216) [2023-12-24 15:06:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1665 transitions. [2023-12-24 15:06:30,155 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1665 transitions. Word has length 171 [2023-12-24 15:06:30,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:06:30,155 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1665 transitions. [2023-12-24 15:06:30,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-24 15:06:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1665 transitions. [2023-12-24 15:06:30,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-24 15:06:30,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:06:30,158 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:30,172 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 15:06:30,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:06:30,370 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:06:30,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:06:30,370 INFO L85 PathProgramCache]: Analyzing trace with hash -652593743, now seen corresponding path program 1 times [2023-12-24 15:06:30,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:06:30,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072862271] [2023-12-24 15:06:30,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:06:30,371 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 15:06:30,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:06:30,372 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 15:06:30,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-24 15:06:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:06:31,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-24 15:06:31,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:06:31,268 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 15:06:31,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:06:32,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:06:32,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:06:32,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:06:33,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 57 [2023-12-24 15:06:33,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 15:06:33,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 78 [2023-12-24 15:06:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 3 proven. 401 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2023-12-24 15:06:34,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:06:34,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:06:34,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072862271] [2023-12-24 15:06:34,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072862271] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:06:34,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [229921877] [2023-12-24 15:06:34,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:06:34,450 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 15:06:34,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 15:06:34,451 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 15:06:34,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-12-24 15:06:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:06:36,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 15:06:36,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:06:37,101 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 15:06:37,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:06:38,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:06:38,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:06:38,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-12-24 15:06:39,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 57 [2023-12-24 15:06:40,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 78 [2023-12-24 15:06:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 3 proven. 401 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2023-12-24 15:06:40,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:06:40,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [229921877] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 15:06:40,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:06:40,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2023-12-24 15:06:40,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47394247] [2023-12-24 15:06:40,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:06:40,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-24 15:06:40,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:06:40,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-24 15:06:40,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2023-12-24 15:06:40,347 INFO L87 Difference]: Start difference. First operand 1282 states and 1665 transitions. Second operand has 25 states, 23 states have (on average 6.260869565217392) internal successors, (144), 22 states have internal predecessors, (144), 8 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 6 states have call predecessors, (42), 8 states have call successors, (42) [2023-12-24 15:06:45,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:06:45,725 INFO L93 Difference]: Finished difference Result 3109 states and 3963 transitions. [2023-12-24 15:06:45,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-24 15:06:45,726 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 6.260869565217392) internal successors, (144), 22 states have internal predecessors, (144), 8 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 6 states have call predecessors, (42), 8 states have call successors, (42) Word has length 172 [2023-12-24 15:06:45,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:06:45,732 INFO L225 Difference]: With dead ends: 3109 [2023-12-24 15:06:45,732 INFO L226 Difference]: Without dead ends: 1828 [2023-12-24 15:06:45,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=448, Invalid=1904, Unknown=0, NotChecked=0, Total=2352 [2023-12-24 15:06:45,735 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 800 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-24 15:06:45,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1704 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-24 15:06:45,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2023-12-24 15:06:46,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1204. [2023-12-24 15:06:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 943 states have (on average 1.1930010604453871) internal successors, (1125), 964 states have internal predecessors, (1125), 216 states have call successors, (216), 44 states have call predecessors, (216), 44 states have return successors, (216), 195 states have call predecessors, (216), 216 states have call successors, (216) [2023-12-24 15:06:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1557 transitions. [2023-12-24 15:06:46,013 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1557 transitions. Word has length 172 [2023-12-24 15:06:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:06:46,014 INFO L495 AbstractCegarLoop]: Abstraction has 1204 states and 1557 transitions. [2023-12-24 15:06:46,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 6.260869565217392) internal successors, (144), 22 states have internal predecessors, (144), 8 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 6 states have call predecessors, (42), 8 states have call successors, (42) [2023-12-24 15:06:46,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1557 transitions. [2023-12-24 15:06:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-24 15:06:46,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:06:46,016 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:46,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-12-24 15:06:46,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2023-12-24 15:06:46,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 15:06:46,431 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:06:46,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:06:46,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1468699629, now seen corresponding path program 1 times [2023-12-24 15:06:46,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:06:46,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470105540] [2023-12-24 15:06:46,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:06:46,432 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 15:06:46,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:06:46,433 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 15:06:46,470 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 15:06:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:06:46,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 15:06:46,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:06:47,199 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2023-12-24 15:06:47,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2023-12-24 15:06:47,266 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 15:06:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 19 proven. 137 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-24 15:06:47,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:06:47,602 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2023-12-24 15:06:47,602 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 22 treesize of output 21 [2023-12-24 15:06:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-24 15:06:47,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:06:47,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470105540] [2023-12-24 15:06:47,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470105540] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 15:06:47,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:06:47,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-24 15:06:47,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648670164] [2023-12-24 15:06:47,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:06:47,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 15:06:47,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:06:47,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 15:06:47,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-24 15:06:47,651 INFO L87 Difference]: Start difference. First operand 1204 states and 1557 transitions. Second operand has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 14 states have internal predecessors, (92), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2023-12-24 15:06:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:06:48,894 INFO L93 Difference]: Finished difference Result 2364 states and 3050 transitions. [2023-12-24 15:06:48,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 15:06:48,910 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 14 states have internal predecessors, (92), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) Word has length 173 [2023-12-24 15:06:48,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:06:48,931 INFO L225 Difference]: With dead ends: 2364 [2023-12-24 15:06:48,931 INFO L226 Difference]: Without dead ends: 1161 [2023-12-24 15:06:48,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2023-12-24 15:06:48,943 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 262 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 15:06:48,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 616 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 15:06:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2023-12-24 15:06:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1108. [2023-12-24 15:06:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 847 states have (on average 1.1818181818181819) internal successors, (1001), 868 states have internal predecessors, (1001), 216 states have call successors, (216), 44 states have call predecessors, (216), 44 states have return successors, (216), 195 states have call predecessors, (216), 216 states have call successors, (216) [2023-12-24 15:06:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1433 transitions. [2023-12-24 15:06:49,381 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1433 transitions. Word has length 173 [2023-12-24 15:06:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:06:49,381 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1433 transitions. [2023-12-24 15:06:49,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 14 states have internal predecessors, (92), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2023-12-24 15:06:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1433 transitions. [2023-12-24 15:06:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-12-24 15:06:49,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 15:06:49,383 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:49,399 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 15:06:49,593 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 15:06:49,593 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 15:06:49,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 15:06:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1765397183, now seen corresponding path program 1 times [2023-12-24 15:06:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 15:06:49,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287118142] [2023-12-24 15:06:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 15:06:49,594 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 15:06:49,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 15:06:49,596 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 15:06:49,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-24 15:06:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 15:06:50,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 15:06:50,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 15:06:50,405 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2023-12-24 15:06:50,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2023-12-24 15:06:50,440 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 15:06:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 19 proven. 137 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-24 15:06:50,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 15:06:50,771 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2023-12-24 15:06:50,771 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 22 treesize of output 21 [2023-12-24 15:06:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-24 15:06:50,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 15:06:50,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287118142] [2023-12-24 15:06:50,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287118142] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 15:06:50,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 15:06:50,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-24 15:06:50,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137919399] [2023-12-24 15:06:50,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 15:06:50,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 15:06:50,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 15:06:50,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 15:06:50,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-24 15:06:50,813 INFO L87 Difference]: Start difference. First operand 1108 states and 1433 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2023-12-24 15:06:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 15:06:51,890 INFO L93 Difference]: Finished difference Result 1985 states and 2563 transitions. [2023-12-24 15:06:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 15:06:51,902 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) Word has length 174 [2023-12-24 15:06:51,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 15:06:51,902 INFO L225 Difference]: With dead ends: 1985 [2023-12-24 15:06:51,902 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 15:06:51,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 334 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2023-12-24 15:06:51,905 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 162 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 15:06:51,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 579 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 15:06:51,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 15:06:51,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 15:06:51,906 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 15:06:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 15:06:51,906 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2023-12-24 15:06:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 15:06:51,906 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 15:06:51,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2023-12-24 15:06:51,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 15:06:51,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 15:06:51,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 15:06:51,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-12-24 15:06:52,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 15:06:52,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 15:07:48,722 WARN L293 SmtUtils]: Spent 22.23s on a formula simplification. DAG size of input: 751 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 15:07:59,960 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 15:07:59,964 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 15:07:59,964 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 15:07:59,964 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 15:07:59,964 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 15:07:59,964 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 15:07:59,964 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 15:07:59,965 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse28 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse28 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse28 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse29 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse29) ((_ extract 30 23) .cse29) ((_ extract 22 0) .cse29)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse28 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26)))) [2023-12-24 15:07:59,965 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-12-24 15:07:59,965 INFO L895 garLoopResultBuilder]: At program point L119(line 119) the Hoare annotation is: (let ((.cse28 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse28 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse28 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse29 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse29) ((_ extract 30 23) .cse29) ((_ extract 22 0) .cse29)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse28 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26)))) [2023-12-24 15:07:59,965 INFO L899 garLoopResultBuilder]: For program point L119-1(line 119) no Hoare annotation was computed. [2023-12-24 15:07:59,966 INFO L895 garLoopResultBuilder]: At program point L120(line 120) the Hoare annotation is: (let ((.cse28 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse28 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse28 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse29 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse29) ((_ extract 30 23) .cse29) ((_ extract 22 0) .cse29)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse28 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26)))) [2023-12-24 15:07:59,966 INFO L899 garLoopResultBuilder]: For program point L120-1(line 120) no Hoare annotation was computed. [2023-12-24 15:07:59,966 INFO L895 garLoopResultBuilder]: At program point L104(line 104) the Hoare annotation is: (let ((.cse28 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse28 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse28 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse29 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse29) ((_ extract 30 23) .cse29) ((_ extract 22 0) .cse29)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse28 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26)))) [2023-12-24 15:07:59,966 INFO L899 garLoopResultBuilder]: For program point L104-1(line 104) no Hoare annotation was computed. [2023-12-24 15:07:59,966 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (let ((.cse1 (select |#memory_int#4| (_ bv7 32)))) (and (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32)) (= |~#unsigned_char_Array_0~0.base| (_ bv7 32)) (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32)) (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32)) (fp.geq (let ((.cse0 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base) (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))) (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32)) (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset) (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32)) (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32)) (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset) (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32)) (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse1 (_ bv5 32)))) (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse1 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|))) (= |~#float_Array_0~0.offset| (_ bv0 32)) (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base) (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32)) (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset) (= |~#float_Array_0~0.base| (_ bv5 32)) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse1 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) [2023-12-24 15:07:59,967 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-12-24 15:07:59,967 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (let ((.cse28 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse28 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse28 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse29 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse29) ((_ extract 30 23) .cse29) ((_ extract 22 0) .cse29)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse28 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26)))) [2023-12-24 15:07:59,967 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-12-24 15:07:59,967 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse1 (select |#memory_int#4| (_ bv7 32)))) (and (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32)) (= |~#unsigned_char_Array_0~0.base| (_ bv7 32)) (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32)) (= ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset)) |ULTIMATE.start_updateVariables_#t~mem33#1|) (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32)) (fp.geq (let ((.cse0 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base) (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))) (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32)) (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset) (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32)) (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32)) (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset) (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32)) (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse1 (_ bv5 32)))) (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse1 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|))) (= |~#float_Array_0~0.offset| (_ bv0 32)) (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base) (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32)) (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset) (= |~#float_Array_0~0.base| (_ bv5 32)) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse1 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) [2023-12-24 15:07:59,967 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-24 15:07:59,967 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2023-12-24 15:07:59,967 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 77) no Hoare annotation was computed. [2023-12-24 15:07:59,968 INFO L895 garLoopResultBuilder]: At program point L107(line 107) the Hoare annotation is: (let ((.cse28 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse28 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse28 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse29 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse29) ((_ extract 30 23) .cse29) ((_ extract 22 0) .cse29)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse28 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26)))) [2023-12-24 15:07:59,968 INFO L899 garLoopResultBuilder]: For program point L107-1(line 107) no Hoare annotation was computed. [2023-12-24 15:07:59,968 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 15:07:59,968 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-12-24 15:07:59,968 INFO L899 garLoopResultBuilder]: For program point L91-2(line 91) no Hoare annotation was computed. [2023-12-24 15:07:59,968 INFO L899 garLoopResultBuilder]: For program point L91-3(line 91) no Hoare annotation was computed. [2023-12-24 15:07:59,968 INFO L899 garLoopResultBuilder]: For program point L91-5(line 91) no Hoare annotation was computed. [2023-12-24 15:07:59,968 INFO L899 garLoopResultBuilder]: For program point L91-7(line 91) no Hoare annotation was computed. [2023-12-24 15:07:59,969 INFO L895 garLoopResultBuilder]: At program point L91-8(line 91) the Hoare annotation is: (let ((.cse33 (let ((.cse37 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse37) ((_ extract 30 23) .cse37) ((_ extract 22 0) .cse37)))) (.cse34 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse35 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse10 (not |ULTIMATE.start_updateVariables_#t~short37#1|)) (.cse26 (fp.leq .cse33 (fp.neg .cse34))) (.cse36 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse15 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse16 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse17 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse18 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse19 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse20 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse21 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse22 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse23 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse36 (_ bv5 32))))) (.cse24 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse25 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse36 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse27 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse28 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse29 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse31 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse36 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|)))) (.cse4 (not |ULTIMATE.start_updateVariables_#t~short40#1|)) (.cse7 (not |ULTIMATE.start_updateVariables_#t~short41#1|)) (.cse14 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (.cse0 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse1 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse3 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse5 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse6 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse8 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse32 (or (and (not .cse26) .cse10) (and |ULTIMATE.start_updateVariables_#t~short37#1| .cse26))) (.cse9 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse11 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse30 (fp.geq .cse33 (fp.neg .cse35))) (.cse12 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (fp.geq (let ((.cse13 (select (select |#memory_int#2| |~#float_Array_0~0.base|) |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))) .cse14))) (and .cse15 .cse16 .cse0 .cse1 .cse2 .cse17 .cse18 .cse3 .cse19 .cse20 .cse5 |ULTIMATE.start_updateVariables_#t~short37#1| |ULTIMATE.start_updateVariables_#t~short41#1| .cse21 .cse22 .cse6 .cse8 .cse23 .cse24 .cse25 .cse26 .cse9 .cse27 .cse28 .cse29 .cse11 .cse12 .cse30 .cse31) (and .cse15 .cse16 .cse0 .cse1 .cse2 .cse17 .cse18 .cse3 .cse19 .cse20 .cse5 |ULTIMATE.start_updateVariables_#t~short41#1| |ULTIMATE.start_updateVariables_#t~short40#1| .cse21 .cse22 .cse6 .cse8 .cse32 .cse23 .cse24 .cse25 .cse9 .cse27 .cse28 (fp.geq .cse33 .cse34) .cse29 .cse11 .cse12 .cse31 (fp.leq .cse33 .cse35)) (and .cse4 .cse7 (or (and .cse0 .cse1 .cse2 (fp.geq .cse33 .cse14) .cse3 .cse5 |ULTIMATE.start_updateVariables_#t~short37#1| .cse6 .cse8 .cse9 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse32 .cse9 .cse11 .cse30)) .cse12))))) [2023-12-24 15:07:59,969 INFO L899 garLoopResultBuilder]: For program point L91-9(line 91) no Hoare annotation was computed. [2023-12-24 15:07:59,969 INFO L895 garLoopResultBuilder]: At program point L108(line 108) the Hoare annotation is: (let ((.cse28 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse28 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse28 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse29 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse29) ((_ extract 30 23) .cse29) ((_ extract 22 0) .cse29)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse28 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26)))) [2023-12-24 15:07:59,969 INFO L899 garLoopResultBuilder]: For program point L108-1(line 108) no Hoare annotation was computed. [2023-12-24 15:07:59,969 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 85) no Hoare annotation was computed. [2023-12-24 15:07:59,969 INFO L899 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,969 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2023-12-24 15:07:59,969 INFO L899 garLoopResultBuilder]: For program point L126-1(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,969 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 68) no Hoare annotation was computed. [2023-12-24 15:07:59,969 INFO L899 garLoopResultBuilder]: For program point L93-2(line 93) no Hoare annotation was computed. [2023-12-24 15:07:59,969 INFO L899 garLoopResultBuilder]: For program point L60-1(lines 60 68) no Hoare annotation was computed. [2023-12-24 15:07:59,969 INFO L899 garLoopResultBuilder]: For program point L126-3(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,969 INFO L899 garLoopResultBuilder]: For program point L93-3(line 93) no Hoare annotation was computed. [2023-12-24 15:07:59,969 INFO L899 garLoopResultBuilder]: For program point L126-5(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,969 INFO L899 garLoopResultBuilder]: For program point L93-5(line 93) no Hoare annotation was computed. [2023-12-24 15:07:59,969 INFO L899 garLoopResultBuilder]: For program point L126-6(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,970 INFO L899 garLoopResultBuilder]: For program point L126-7(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,970 INFO L899 garLoopResultBuilder]: For program point L93-7(line 93) no Hoare annotation was computed. [2023-12-24 15:07:59,970 INFO L899 garLoopResultBuilder]: For program point L126-8(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,970 INFO L895 garLoopResultBuilder]: At program point L93-8(line 93) the Hoare annotation is: (let ((.cse29 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse29 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse29 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse30 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse30) ((_ extract 30 23) .cse30) ((_ extract 22 0) .cse30)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse29 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|)))) (.cse28 (not |ULTIMATE.start_updateVariables_#t~short45#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27) .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26 .cse28)))) [2023-12-24 15:07:59,970 INFO L899 garLoopResultBuilder]: For program point L93-9(line 93) no Hoare annotation was computed. [2023-12-24 15:07:59,970 INFO L899 garLoopResultBuilder]: For program point L126-10(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,970 INFO L899 garLoopResultBuilder]: For program point L126-12(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,970 INFO L899 garLoopResultBuilder]: For program point L126-13(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,970 INFO L899 garLoopResultBuilder]: For program point L126-15(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,971 INFO L895 garLoopResultBuilder]: At program point L110(line 110) the Hoare annotation is: (let ((.cse28 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse28 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse28 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse29 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse29) ((_ extract 30 23) .cse29) ((_ extract 22 0) .cse29)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse28 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26)))) [2023-12-24 15:07:59,971 INFO L899 garLoopResultBuilder]: For program point L110-1(line 110) no Hoare annotation was computed. [2023-12-24 15:07:59,971 INFO L899 garLoopResultBuilder]: For program point L126-17(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,971 INFO L899 garLoopResultBuilder]: For program point L126-18(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,971 INFO L899 garLoopResultBuilder]: For program point L126-19(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,971 INFO L899 garLoopResultBuilder]: For program point L126-21(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,971 INFO L899 garLoopResultBuilder]: For program point L126-23(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,971 INFO L899 garLoopResultBuilder]: For program point L126-24(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,971 INFO L899 garLoopResultBuilder]: For program point L126-26(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,971 INFO L899 garLoopResultBuilder]: For program point L126-27(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,971 INFO L899 garLoopResultBuilder]: For program point L126-29(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,971 INFO L899 garLoopResultBuilder]: For program point L126-30(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,971 INFO L899 garLoopResultBuilder]: For program point L126-32(line 126) no Hoare annotation was computed. [2023-12-24 15:07:59,971 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 65) no Hoare annotation was computed. [2023-12-24 15:07:59,972 INFO L895 garLoopResultBuilder]: At program point L111(line 111) the Hoare annotation is: (let ((.cse28 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse28 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse28 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse29 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse29) ((_ extract 30 23) .cse29) ((_ extract 22 0) .cse29)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse28 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26)))) [2023-12-24 15:07:59,972 INFO L899 garLoopResultBuilder]: For program point L111-1(line 111) no Hoare annotation was computed. [2023-12-24 15:07:59,972 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 84) no Hoare annotation was computed. [2023-12-24 15:07:59,972 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2023-12-24 15:07:59,972 INFO L899 garLoopResultBuilder]: For program point L95-2(line 95) no Hoare annotation was computed. [2023-12-24 15:07:59,972 INFO L899 garLoopResultBuilder]: For program point L95-3(line 95) no Hoare annotation was computed. [2023-12-24 15:07:59,972 INFO L899 garLoopResultBuilder]: For program point L95-5(line 95) no Hoare annotation was computed. [2023-12-24 15:07:59,972 INFO L899 garLoopResultBuilder]: For program point L95-7(line 95) no Hoare annotation was computed. [2023-12-24 15:07:59,973 INFO L895 garLoopResultBuilder]: At program point L95-8(line 95) the Hoare annotation is: (let ((.cse29 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (not |ULTIMATE.start_updateVariables_#t~short53#1|)) (.cse14 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse15 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse16 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse29 (_ bv5 32))))) (.cse17 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse18 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse29 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse23 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse19 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse20 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse21 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse24 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse25 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse26 (= currentRoundingMode roundNearestTiesToEven)) (.cse22 (let ((.cse30 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse30) ((_ extract 30 23) .cse30) ((_ extract 22 0) .cse30)))) (.cse28 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse27 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse29 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (fp.geq .cse22 .cse23) .cse24 .cse25 .cse26 .cse27 (fp.leq .cse22 .cse28)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (fp.leq .cse22 (fp.neg .cse23)) .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 (fp.geq .cse22 (fp.neg .cse28)) .cse27)))) [2023-12-24 15:07:59,973 INFO L899 garLoopResultBuilder]: For program point L95-9(line 95) no Hoare annotation was computed. [2023-12-24 15:07:59,973 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 83) no Hoare annotation was computed. [2023-12-24 15:07:59,973 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 15:07:59,973 INFO L895 garLoopResultBuilder]: At program point L113(line 113) the Hoare annotation is: (let ((.cse28 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse28 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse28 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse29 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse29) ((_ extract 30 23) .cse29) ((_ extract 22 0) .cse29)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse28 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26)))) [2023-12-24 15:07:59,973 INFO L899 garLoopResultBuilder]: For program point L113-1(line 113) no Hoare annotation was computed. [2023-12-24 15:07:59,973 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-12-24 15:07:59,973 INFO L899 garLoopResultBuilder]: For program point L97-2(line 97) no Hoare annotation was computed. [2023-12-24 15:07:59,973 INFO L899 garLoopResultBuilder]: For program point L97-3(line 97) no Hoare annotation was computed. [2023-12-24 15:07:59,973 INFO L899 garLoopResultBuilder]: For program point L97-5(line 97) no Hoare annotation was computed. [2023-12-24 15:07:59,974 INFO L899 garLoopResultBuilder]: For program point L97-7(line 97) no Hoare annotation was computed. [2023-12-24 15:07:59,974 INFO L895 garLoopResultBuilder]: At program point L97-8(line 97) the Hoare annotation is: (let ((.cse34 (select |#memory_int#2| (_ bv5 32)))) (let ((.cse38 (let ((.cse39 (select .cse34 (_ bv16 32)))) (fp ((_ extract 31 31) .cse39) ((_ extract 30 23) .cse39) ((_ extract 22 0) .cse39))))) (let ((.cse35 (select |#memory_int#4| (_ bv7 32))) (.cse18 (fp.geq .cse38 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854776000.0)))) (.cse36 (not |ULTIMATE.start_updateVariables_#t~short61#1|))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse17 (let ((.cse37 (fp.leq .cse38 (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))))) (or (and .cse36 (not .cse37)) (and |ULTIMATE.start_updateVariables_#t~short61#1| .cse37)))) (.cse10 (or (and (not .cse18) .cse36) (and |ULTIMATE.start_updateVariables_#t~short61#1| .cse18))) (.cse11 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse12 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse13 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse15 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse7 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse8 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse9 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse22 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse23 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse24 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse35 (_ bv5 32))))) (.cse25 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse35 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse27 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse28 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse21 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse29 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse30 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse31 (= currentRoundingMode roundNearestTiesToEven)) (.cse32 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse35 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|)))) (.cse19 (let ((.cse33 (select .cse34 (_ bv0 32)))) (fp ((_ extract 31 31) .cse33) ((_ extract 30 23) .cse33) ((_ extract 22 0) .cse33)))) (.cse20 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (let ((.cse14 (fp.leq .cse19 (fp.neg .cse21))) (.cse16 (fp.geq .cse19 (fp.neg .cse20)))) (or (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15 .cse16))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (and .cse17 .cse11 .cse12 .cse13 .cse18 .cse15) (and .cse10 .cse11 .cse12 .cse13 .cse15)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (fp.geq .cse19 .cse21) .cse29 .cse30 .cse31 .cse32 (fp.leq .cse19 .cse20))))))) [2023-12-24 15:07:59,974 INFO L899 garLoopResultBuilder]: For program point L97-9(line 97) no Hoare annotation was computed. [2023-12-24 15:07:59,974 INFO L895 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: (let ((.cse28 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse28 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse28 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse29 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse29) ((_ extract 30 23) .cse29) ((_ extract 22 0) .cse29)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse28 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26)))) [2023-12-24 15:07:59,974 INFO L899 garLoopResultBuilder]: For program point L114-1(line 114) no Hoare annotation was computed. [2023-12-24 15:07:59,974 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 15:07:59,974 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-12-24 15:07:59,975 INFO L899 garLoopResultBuilder]: For program point L82-2(line 82) no Hoare annotation was computed. [2023-12-24 15:07:59,975 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2023-12-24 15:07:59,975 INFO L895 garLoopResultBuilder]: At program point L132-2(lines 132 138) the Hoare annotation is: (let ((.cse1 (select |#memory_int#4| (_ bv7 32)))) (and (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32)) (= |~#unsigned_char_Array_0~0.base| (_ bv7 32)) (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32)) (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32)) (fp.geq (let ((.cse0 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base) (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))) (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32)) (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset) (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32)) (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32)) (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset) (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32)) (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse1 (_ bv5 32)))) (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse1 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|))) (= |~#float_Array_0~0.offset| (_ bv0 32)) (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base) (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32)) (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset) (= |~#float_Array_0~0.base| (_ bv5 32)) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse1 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) [2023-12-24 15:07:59,975 INFO L899 garLoopResultBuilder]: For program point L99-2(line 99) no Hoare annotation was computed. [2023-12-24 15:07:59,975 INFO L899 garLoopResultBuilder]: For program point L132-3(lines 132 138) no Hoare annotation was computed. [2023-12-24 15:07:59,975 INFO L899 garLoopResultBuilder]: For program point L99-3(line 99) no Hoare annotation was computed. [2023-12-24 15:07:59,975 INFO L899 garLoopResultBuilder]: For program point L99-5(line 99) no Hoare annotation was computed. [2023-12-24 15:07:59,975 INFO L899 garLoopResultBuilder]: For program point L99-7(line 99) no Hoare annotation was computed. [2023-12-24 15:07:59,975 INFO L895 garLoopResultBuilder]: At program point L99-8(line 99) the Hoare annotation is: (let ((.cse28 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse28 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse28 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse29 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse29) ((_ extract 30 23) .cse29) ((_ extract 22 0) .cse29)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse28 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26)))) [2023-12-24 15:07:59,976 INFO L899 garLoopResultBuilder]: For program point L99-9(line 99) no Hoare annotation was computed. [2023-12-24 15:07:59,976 INFO L895 garLoopResultBuilder]: At program point L116(line 116) the Hoare annotation is: (let ((.cse28 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse28 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse28 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse29 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse29) ((_ extract 30 23) .cse29) ((_ extract 22 0) .cse29)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse28 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26)))) [2023-12-24 15:07:59,976 INFO L899 garLoopResultBuilder]: For program point L116-1(line 116) no Hoare annotation was computed. [2023-12-24 15:07:59,976 INFO L895 garLoopResultBuilder]: At program point L117(line 117) the Hoare annotation is: (let ((.cse28 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse28 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse28 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse29 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse29) ((_ extract 30 23) .cse29) ((_ extract 22 0) .cse29)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse28 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26)))) [2023-12-24 15:07:59,976 INFO L899 garLoopResultBuilder]: For program point L117-1(line 117) no Hoare annotation was computed. [2023-12-24 15:07:59,976 INFO L895 garLoopResultBuilder]: At program point L101(line 101) the Hoare annotation is: (let ((.cse28 (select |#memory_int#4| (_ bv7 32)))) (let ((.cse0 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (_ bv7 32))) (.cse1 (= |~#unsigned_char_Array_0~0.base| (_ bv7 32))) (.cse2 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.offset (_ bv20 32))) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base (_ bv5 32))) (.cse5 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base)) (.cse6 (= (_ bv16 32) ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.offset)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#unsigned_char_Array_0~0.offset| (_ bv0 32))) (.cse9 (= (_ bv7 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) (.cse10 (= ~float_Array_0_arrayfloat_Array_0arrayVar5_Pointer~0.base (_ bv5 32))) (.cse11 (= ~float_Array_0_arrayfloat_Array_0arrayVar3_Pointer~0.base (_ bv5 32))) (.cse12 (= (_ bv8 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.offset)) (.cse13 (= ~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.offset (_ bv0 32))) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse15 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_41| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_41|) (select .cse28 (_ bv5 32))))) (.cse16 (= (_ bv2 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset)) (.cse17 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_43| (_ BitVec 8))) (= (select .cse28 (_ bv8 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_43|)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse19 (= (_ bv5 32) ~float_Array_0_arrayfloat_Array_0arrayVar4_Pointer~0.base)) (.cse20 (= ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.base (_ bv7 32))) (.cse23 (= (_ bv6 32) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0.offset)) (.cse24 (= |~#float_Array_0~0.base| (_ bv5 32))) (.cse25 (= currentRoundingMode roundNearestTiesToEven)) (.cse21 (let ((.cse29 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)))) (fp ((_ extract 31 31) .cse29) ((_ extract 30 23) .cse29) ((_ extract 22 0) .cse29)))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse26 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_44| (_ BitVec 8))) (= (select .cse28 (_ bv2 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_44|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (fp.geq .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 (fp.leq .cse21 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (fp.leq .cse21 (fp.neg .cse22)) .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 (fp.geq .cse21 (fp.neg .cse27)) .cse26)))) [2023-12-24 15:07:59,976 INFO L899 garLoopResultBuilder]: For program point L101-1(line 101) no Hoare annotation was computed. [2023-12-24 15:07:59,979 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] [2023-12-24 15:07:59,981 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 15:07:59,993 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!offset] could not be translated [2023-12-24 15:07:59,994 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[5bv32][0bv32] could not be translated [2023-12-24 15:07:59,994 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[5bv32][0bv32] could not be translated [2023-12-24 15:07:59,994 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[5bv32][0bv32] could not be translated [2023-12-24 15:07:59,994 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[BitvecLiteral[5,32]]],[BitvecLiteral[0,32]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[BitvecLiteral[5,32]]],[BitvecLiteral[0,32]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[BitvecLiteral[5,32]]],[BitvecLiteral[0,32]]],22,0]]] [2023-12-24 15:07:59,995 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet89#1_41 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet89#1_41) == #memory_int#4[7bv32][5bv32]) could not be translated [2023-12-24 15:07:59,995 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet92#1_43 : bv8 :: #memory_int#4[7bv32][8bv32] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet92#1_43)) could not be translated [2023-12-24 15:07:59,995 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 15:07:59,995 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet86#1_44 : bv8 :: #memory_int#4[7bv32][2bv32] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet86#1_44)) could not be translated [2023-12-24 15:07:59,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 03:07:59 BoogieIcfgContainer [2023-12-24 15:07:59,996 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 15:07:59,996 INFO L158 Benchmark]: Toolchain (without parser) took 207179.29ms. Allocated memory was 283.1MB in the beginning and 936.4MB in the end (delta: 653.3MB). Free memory was 230.9MB in the beginning and 525.0MB in the end (delta: -294.0MB). Peak memory consumption was 558.2MB. Max. memory is 8.0GB. [2023-12-24 15:07:59,996 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 182.5MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 15:07:59,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.18ms. Allocated memory is still 283.1MB. Free memory was 230.9MB in the beginning and 213.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 15:07:59,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.23ms. Allocated memory is still 283.1MB. Free memory was 213.1MB in the beginning and 209.5MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 15:07:59,997 INFO L158 Benchmark]: Boogie Preprocessor took 100.45ms. Allocated memory is still 283.1MB. Free memory was 209.5MB in the beginning and 203.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-24 15:07:59,997 INFO L158 Benchmark]: RCFGBuilder took 1660.86ms. Allocated memory is still 283.1MB. Free memory was 203.7MB in the beginning and 156.0MB in the end (delta: 47.7MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. [2023-12-24 15:07:59,997 INFO L158 Benchmark]: TraceAbstraction took 204982.09ms. Allocated memory was 283.1MB in the beginning and 936.4MB in the end (delta: 653.3MB). Free memory was 155.0MB in the beginning and 525.0MB in the end (delta: -370.0MB). Peak memory consumption was 482.7MB. Max. memory is 8.0GB. [2023-12-24 15:07:59,998 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.54ms. Allocated memory is still 182.5MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 353.18ms. Allocated memory is still 283.1MB. Free memory was 230.9MB in the beginning and 213.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 77.23ms. Allocated memory is still 283.1MB. Free memory was 213.1MB in the beginning and 209.5MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 100.45ms. Allocated memory is still 283.1MB. Free memory was 209.5MB in the beginning and 203.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1660.86ms. Allocated memory is still 283.1MB. Free memory was 203.7MB in the beginning and 156.0MB in the end (delta: 47.7MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. * TraceAbstraction took 204982.09ms. Allocated memory was 283.1MB in the beginning and 936.4MB in the end (delta: 653.3MB). Free memory was 155.0MB in the beginning and 525.0MB in the end (delta: -370.0MB). Peak memory consumption was 482.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[5bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[5bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[5bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[BitvecLiteral[5,32]]],[BitvecLiteral[0,32]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[BitvecLiteral[5,32]]],[BitvecLiteral[0,32]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[BitvecLiteral[5,32]]],[BitvecLiteral[0,32]]],22,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet89#1_41 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet89#1_41) == #memory_int#4[7bv32][5bv32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet92#1_43 : bv8 :: #memory_int#4[7bv32][8bv32] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet92#1_43)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet86#1_44 : bv8 :: #memory_int#4[7bv32][2bv32] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet86#1_44)) 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, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 204.9s, OverallIterations: 23, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 60.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 67.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8345 SdHoareTripleChecker+Valid, 39.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8322 mSDsluCounter, 19172 SdHoareTripleChecker+Invalid, 37.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15607 mSDsCounter, 2085 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9154 IncrementalHoareTripleChecker+Invalid, 11239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2085 mSolverCounterUnsat, 3565 mSDtfsCounter, 9154 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6212 GetRequests, 5764 SyntacticMatches, 11 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 4224 ImplicationChecksByTransitivity, 24.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1409occurred in iteration=17, InterpolantAutomatonStates: 303, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 1746 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 2621 PreInvPairs, 2820 NumberOfFragments, 6718 HoareAnnotationTreeSize, 2621 FormulaSimplifications, 741112 FormulaSimplificationTreeSizeReduction, 14.1s HoareSimplificationTime, 23 FormulaSimplificationsInter, 666492 FormulaSimplificationTreeSizeReductionInter, 53.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 15.9s SatisfiabilityAnalysisTime, 46.9s InterpolantComputationTime, 4884 NumberOfCodeBlocks, 4884 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 5700 ConstructedInterpolants, 229 QuantifiedInterpolants, 103661 SizeOfPredicates, 329 NumberOfNonLiveVariables, 11638 ConjunctsInSsa, 531 ConjunctsInUnsatCore, 34 InterpolantComputations, 13 PerfectInterpolantSequences, 24031/28560 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) RESULT: Ultimate proved your program to be correct! [2023-12-24 15:08:00,148 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...