/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-21.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 14:35:11,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 14:35:11,737 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 14:35:11,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 14:35:11,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 14:35:11,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 14:35:11,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 14:35:11,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 14:35:11,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 14:35:11,755 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 14:35:11,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 14:35:11,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 14:35:11,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 14:35:11,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 14:35:11,758 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 14:35:11,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 14:35:11,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 14:35:11,759 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 14:35:11,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 14:35:11,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 14:35:11,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 14:35:11,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 14:35:11,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 14:35:11,761 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 14:35:11,761 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 14:35:11,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 14:35:11,761 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 14:35:11,761 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 14:35:11,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 14:35:11,762 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 14:35:11,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 14:35:11,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 14:35:11,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 14:35:11,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 14:35:11,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 14:35:11,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 14:35:11,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 14:35:11,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 14:35:11,763 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 14:35:11,763 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 14:35:11,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 14:35:11,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 14:35:11,764 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 14:35:11,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 14:35:11,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 14:35:11,765 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 14:35:11,765 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 14:35:11,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 14:35:11,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 14:35:11,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 14:35:11,983 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 14:35:11,983 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 14:35:11,984 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-21.i [2023-12-24 14:35:13,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 14:35:13,284 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 14:35:13,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-21.i [2023-12-24 14:35:13,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b48c75c6/a005f423b89e4e74b055fc61043ecb57/FLAG67ed8d5a0 [2023-12-24 14:35:13,315 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b48c75c6/a005f423b89e4e74b055fc61043ecb57 [2023-12-24 14:35:13,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 14:35:13,318 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 14:35:13,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 14:35:13,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 14:35:13,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 14:35:13,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 02:35:13" (1/1) ... [2023-12-24 14:35:13,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45115b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:35:13, skipping insertion in model container [2023-12-24 14:35:13,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 02:35:13" (1/1) ... [2023-12-24 14:35:13,353 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 14:35:13,454 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-21.i[917,930] [2023-12-24 14:35:13,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 14:35:13,505 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 14:35:13,514 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-21.i[917,930] [2023-12-24 14:35:13,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 14:35:13,552 INFO L206 MainTranslator]: Completed translation [2023-12-24 14:35:13,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:35:13 WrapperNode [2023-12-24 14:35:13,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 14:35:13,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 14:35:13,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 14:35:13,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 14:35:13,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:35:13" (1/1) ... [2023-12-24 14:35:13,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:35:13" (1/1) ... [2023-12-24 14:35:13,604 INFO L138 Inliner]: procedures = 36, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2023-12-24 14:35:13,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 14:35:13,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 14:35:13,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 14:35:13,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 14:35:13,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:35:13" (1/1) ... [2023-12-24 14:35:13,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:35:13" (1/1) ... [2023-12-24 14:35:13,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:35:13" (1/1) ... [2023-12-24 14:35:13,675 INFO L175 MemorySlicer]: Split 91 memory accesses to 6 slices as follows [2, 14, 34, 16, 6, 19]. 37 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 3, 2, 1, 1]. The 12 writes are split as follows [0, 3, 3, 2, 2, 2]. [2023-12-24 14:35:13,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:35:13" (1/1) ... [2023-12-24 14:35:13,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:35:13" (1/1) ... [2023-12-24 14:35:13,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:35:13" (1/1) ... [2023-12-24 14:35:13,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:35:13" (1/1) ... [2023-12-24 14:35:13,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:35:13" (1/1) ... [2023-12-24 14:35:13,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:35:13" (1/1) ... [2023-12-24 14:35:13,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 14:35:13,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 14:35:13,706 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 14:35:13,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 14:35:13,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:35:13" (1/1) ... [2023-12-24 14:35:13,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 14:35:13,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 14:35:13,753 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 14:35:13,764 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 14:35:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 14:35:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-12-24 14:35:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-12-24 14:35:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-12-24 14:35:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2023-12-24 14:35:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2023-12-24 14:35:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2023-12-24 14:35:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-12-24 14:35:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-12-24 14:35:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-12-24 14:35:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2023-12-24 14:35:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2023-12-24 14:35:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2023-12-24 14:35:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 14:35:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 14:35:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 14:35:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 14:35:13,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 14:35:13,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-24 14:35:13,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 14:35:13,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 14:35:13,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-24 14:35:13,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-24 14:35:13,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-24 14:35:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-12-24 14:35:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 14:35:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 14:35:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 14:35:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 14:35:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 14:35:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-24 14:35:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-12-24 14:35:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-12-24 14:35:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2023-12-24 14:35:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2023-12-24 14:35:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2023-12-24 14:35:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2023-12-24 14:35:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-12-24 14:35:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-12-24 14:35:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2023-12-24 14:35:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2023-12-24 14:35:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2023-12-24 14:35:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2023-12-24 14:35:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 14:35:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 14:35:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-24 14:35:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-24 14:35:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-24 14:35:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-12-24 14:35:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-12-24 14:35:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-12-24 14:35:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2023-12-24 14:35:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2023-12-24 14:35:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2023-12-24 14:35:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2023-12-24 14:35:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-12-24 14:35:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-12-24 14:35:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2023-12-24 14:35:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2023-12-24 14:35:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2023-12-24 14:35:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2023-12-24 14:35:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 14:35:13,789 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 14:35:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 14:35:13,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 14:35:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 14:35:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 14:35:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 14:35:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 14:35:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 14:35:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-24 14:35:13,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 14:35:13,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 14:35:13,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-24 14:35:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-24 14:35:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-24 14:35:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-12-24 14:35:13,925 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 14:35:13,926 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 14:35:21,929 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 14:35:21,959 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 14:35:21,960 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 14:35:21,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:35:21 BoogieIcfgContainer [2023-12-24 14:35:21,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 14:35:21,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 14:35:21,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 14:35:21,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 14:35:21,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 02:35:13" (1/3) ... [2023-12-24 14:35:21,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e93235c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:35:21, skipping insertion in model container [2023-12-24 14:35:21,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:35:13" (2/3) ... [2023-12-24 14:35:21,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e93235c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:35:21, skipping insertion in model container [2023-12-24 14:35:21,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:35:21" (3/3) ... [2023-12-24 14:35:21,966 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-21.i [2023-12-24 14:35:21,978 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 14:35:21,978 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 14:35:22,013 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 14:35:22,018 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;@32cc3e42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 14:35:22,018 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 14:35:22,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-24 14:35:22,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 14:35:22,029 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:35:22,029 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:35:22,030 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:35:22,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:35:22,035 INFO L85 PathProgramCache]: Analyzing trace with hash 456144231, now seen corresponding path program 1 times [2023-12-24 14:35:22,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:35:22,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569977564] [2023-12-24 14:35:22,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:35:22,051 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 14:35:22,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:35:22,054 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 14:35:22,113 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 14:35:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:35:22,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 14:35:22,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:35:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-24 14:35:22,516 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:35:22,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:35:22,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569977564] [2023-12-24 14:35:22,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569977564] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:35:22,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:35:22,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 14:35:22,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701523111] [2023-12-24 14:35:22,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:35:22,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 14:35:22,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:35:22,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 14:35:22,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 14:35:22,543 INFO L87 Difference]: Start difference. First operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 14:35:22,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:35:22,579 INFO L93 Difference]: Finished difference Result 175 states and 275 transitions. [2023-12-24 14:35:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 14:35:22,581 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 75 [2023-12-24 14:35:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:35:22,586 INFO L225 Difference]: With dead ends: 175 [2023-12-24 14:35:22,586 INFO L226 Difference]: Without dead ends: 87 [2023-12-24 14:35:22,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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 14:35:22,591 INFO L413 NwaCegarLoop]: 126 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, 126 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 14:35:22,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 14:35:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-24 14:35:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-12-24 14:35:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 78 states have internal predecessors, (116), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-24 14:35:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2023-12-24 14:35:22,644 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 75 [2023-12-24 14:35:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:35:22,644 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2023-12-24 14:35:22,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 14:35:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2023-12-24 14:35:22,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 14:35:22,647 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:35:22,647 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:35:22,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 14:35:22,855 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 14:35:22,857 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:35:22,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:35:22,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1324363049, now seen corresponding path program 1 times [2023-12-24 14:35:22,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:35:22,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220956986] [2023-12-24 14:35:22,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:35:22,858 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 14:35:22,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:35:22,863 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 14:35:22,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 14:35:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:35:23,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 14:35:23,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:35:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-24 14:35:23,213 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:35:23,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:35:23,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220956986] [2023-12-24 14:35:23,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220956986] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:35:23,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:35:23,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 14:35:23,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906309996] [2023-12-24 14:35:23,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:35:23,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 14:35:23,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:35:23,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 14:35:23,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 14:35:23,216 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 14:35:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:35:23,311 INFO L93 Difference]: Finished difference Result 179 states and 268 transitions. [2023-12-24 14:35:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 14:35:23,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 75 [2023-12-24 14:35:23,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:35:23,313 INFO L225 Difference]: With dead ends: 179 [2023-12-24 14:35:23,313 INFO L226 Difference]: Without dead ends: 93 [2023-12-24 14:35:23,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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 14:35:23,314 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 10 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 370 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 14:35:23,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 370 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 14:35:23,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-24 14:35:23,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2023-12-24 14:35:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 80 states have (on average 1.475) internal successors, (118), 80 states have internal predecessors, (118), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-24 14:35:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 132 transitions. [2023-12-24 14:35:23,325 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 132 transitions. Word has length 75 [2023-12-24 14:35:23,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:35:23,326 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 132 transitions. [2023-12-24 14:35:23,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 14:35:23,326 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 132 transitions. [2023-12-24 14:35:23,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 14:35:23,327 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:35:23,327 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:35:23,337 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 14:35:23,527 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 14:35:23,528 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:35:23,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:35:23,529 INFO L85 PathProgramCache]: Analyzing trace with hash -637211609, now seen corresponding path program 1 times [2023-12-24 14:35:23,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:35:23,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64040267] [2023-12-24 14:35:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:35:23,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:35:23,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:35:23,531 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 14:35:23,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 14:35:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:35:23,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 14:35:23,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:35:23,856 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 14:35:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 14:35:24,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:35:24,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:35:24,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64040267] [2023-12-24 14:35:24,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64040267] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:35:24,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:35:24,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 14:35:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342322931] [2023-12-24 14:35:24,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:35:24,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 14:35:24,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:35:24,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 14:35:24,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 14:35:24,012 INFO L87 Difference]: Start difference. First operand 89 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:35:26,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:35:27,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:35:30,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:35:31,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:35:35,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:35:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:35:35,181 INFO L93 Difference]: Finished difference Result 295 states and 437 transitions. [2023-12-24 14:35:35,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 14:35:35,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2023-12-24 14:35:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:35:35,183 INFO L225 Difference]: With dead ends: 295 [2023-12-24 14:35:35,183 INFO L226 Difference]: Without dead ends: 207 [2023-12-24 14:35:35,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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 14:35:35,184 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 229 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-12-24 14:35:35,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 352 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2023-12-24 14:35:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-12-24 14:35:35,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2023-12-24 14:35:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 164 states have (on average 1.451219512195122) internal successors, (238), 164 states have internal predecessors, (238), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 14:35:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 266 transitions. [2023-12-24 14:35:35,218 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 266 transitions. Word has length 75 [2023-12-24 14:35:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:35:35,219 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 266 transitions. [2023-12-24 14:35:35,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:35:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 266 transitions. [2023-12-24 14:35:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-24 14:35:35,220 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:35:35,220 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:35:35,234 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 (4)] Ended with exit code 0 [2023-12-24 14:35:35,420 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 14:35:35,421 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:35:35,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:35:35,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1571373308, now seen corresponding path program 1 times [2023-12-24 14:35:35,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:35:35,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013199367] [2023-12-24 14:35:35,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:35:35,422 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 14:35:35,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:35:35,424 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 14:35:35,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 14:35:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:35:35,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 14:35:35,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:35:36,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-24 14:35:36,297 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 14:35:36,297 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 14:35:36,779 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 14:35:36,779 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 30 treesize of output 25 [2023-12-24 14:35:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-24 14:35:36,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:35:36,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013199367] [2023-12-24 14:35:36,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013199367] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 14:35:36,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 14:35:36,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-12-24 14:35:36,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815895749] [2023-12-24 14:35:36,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 14:35:36,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-24 14:35:36,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:35:36,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-24 14:35:36,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2023-12-24 14:35:36,791 INFO L87 Difference]: Start difference. First operand 181 states and 266 transitions. Second operand has 21 states, 17 states have (on average 5.176470588235294) internal successors, (88), 19 states have internal predecessors, (88), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-12-24 14:35:37,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:35:37,538 INFO L93 Difference]: Finished difference Result 379 states and 543 transitions. [2023-12-24 14:35:37,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 14:35:37,539 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 5.176470588235294) internal successors, (88), 19 states have internal predecessors, (88), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 78 [2023-12-24 14:35:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:35:37,540 INFO L225 Difference]: With dead ends: 379 [2023-12-24 14:35:37,540 INFO L226 Difference]: Without dead ends: 199 [2023-12-24 14:35:37,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2023-12-24 14:35:37,542 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 433 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 14:35:37,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1065 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 14:35:37,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-12-24 14:35:37,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 167. [2023-12-24 14:35:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 146 states have (on average 1.3972602739726028) internal successors, (204), 146 states have internal predecessors, (204), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 14:35:37,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 232 transitions. [2023-12-24 14:35:37,570 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 232 transitions. Word has length 78 [2023-12-24 14:35:37,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:35:37,570 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 232 transitions. [2023-12-24 14:35:37,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 5.176470588235294) internal successors, (88), 19 states have internal predecessors, (88), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-12-24 14:35:37,570 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 232 transitions. [2023-12-24 14:35:37,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-24 14:35:37,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:35:37,571 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:35:37,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 14:35:37,779 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 14:35:37,780 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:35:37,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:35:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1874224900, now seen corresponding path program 1 times [2023-12-24 14:35:37,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:35:37,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938066286] [2023-12-24 14:35:37,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:35:37,781 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 14:35:37,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:35:37,782 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 14:35:37,784 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 14:35:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:35:38,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 14:35:38,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:35:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 14:35:38,237 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:35:38,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:35:38,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938066286] [2023-12-24 14:35:38,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938066286] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:35:38,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:35:38,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 14:35:38,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788325352] [2023-12-24 14:35:38,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:35:38,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 14:35:38,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:35:38,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 14:35:38,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 14:35:38,240 INFO L87 Difference]: Start difference. First operand 167 states and 232 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:35:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:35:38,495 INFO L93 Difference]: Finished difference Result 282 states and 396 transitions. [2023-12-24 14:35:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 14:35:38,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 79 [2023-12-24 14:35:38,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:35:38,496 INFO L225 Difference]: With dead ends: 282 [2023-12-24 14:35:38,496 INFO L226 Difference]: Without dead ends: 186 [2023-12-24 14:35:38,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 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 14:35:38,497 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 72 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 14:35:38,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 472 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 14:35:38,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-12-24 14:35:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2023-12-24 14:35:38,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.389261744966443) internal successors, (207), 149 states have internal predecessors, (207), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 14:35:38,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 235 transitions. [2023-12-24 14:35:38,508 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 235 transitions. Word has length 79 [2023-12-24 14:35:38,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:35:38,508 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 235 transitions. [2023-12-24 14:35:38,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:35:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 235 transitions. [2023-12-24 14:35:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-24 14:35:38,510 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:35:38,510 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:35:38,537 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 14:35:38,737 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 14:35:38,737 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:35:38,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:35:38,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1797014075, now seen corresponding path program 1 times [2023-12-24 14:35:38,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:35:38,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76338368] [2023-12-24 14:35:38,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:35:38,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:35:38,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:35:38,739 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 14:35:38,742 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 14:35:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:35:39,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 14:35:39,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:35:39,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2023-12-24 14:35:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-24 14:35:39,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:35:39,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:35:39,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76338368] [2023-12-24 14:35:39,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76338368] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:35:39,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:35:39,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 14:35:39,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875596479] [2023-12-24 14:35:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:35:39,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 14:35:39,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:35:39,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 14:35:39,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 14:35:39,299 INFO L87 Difference]: Start difference. First operand 170 states and 235 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 14:35:42,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:35:44,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:35:46,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:35:49,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:35:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:35:49,449 INFO L93 Difference]: Finished difference Result 310 states and 431 transitions. [2023-12-24 14:35:49,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 14:35:49,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2023-12-24 14:35:49,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:35:49,481 INFO L225 Difference]: With dead ends: 310 [2023-12-24 14:35:49,481 INFO L226 Difference]: Without dead ends: 182 [2023-12-24 14:35:49,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 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 14:35:49,482 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 114 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2023-12-24 14:35:49,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 376 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2023-12-24 14:35:49,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-24 14:35:49,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2023-12-24 14:35:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.3758389261744965) internal successors, (205), 149 states have internal predecessors, (205), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 14:35:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2023-12-24 14:35:49,497 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 83 [2023-12-24 14:35:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:35:49,498 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2023-12-24 14:35:49,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 14:35:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2023-12-24 14:35:49,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-24 14:35:49,498 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:35:49,499 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:35:49,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-24 14:35:49,714 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 14:35:49,716 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:35:49,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:35:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1513083829, now seen corresponding path program 1 times [2023-12-24 14:35:49,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:35:49,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974821243] [2023-12-24 14:35:49,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:35:49,717 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 14:35:49,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:35:49,718 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 14:35:49,719 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 14:35:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:35:50,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 14:35:50,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:35:50,245 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 14:35:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 14:35:50,267 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:35:50,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:35:50,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974821243] [2023-12-24 14:35:50,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974821243] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:35:50,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:35:50,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 14:35:50,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868010605] [2023-12-24 14:35:50,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:35:50,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 14:35:50,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:35:50,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 14:35:50,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 14:35:50,268 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 14:35:53,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:35:55,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:35:57,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:35:58,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:35:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:35:59,042 INFO L93 Difference]: Finished difference Result 303 states and 417 transitions. [2023-12-24 14:35:59,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 14:35:59,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 85 [2023-12-24 14:35:59,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:35:59,072 INFO L225 Difference]: With dead ends: 303 [2023-12-24 14:35:59,072 INFO L226 Difference]: Without dead ends: 182 [2023-12-24 14:35:59,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 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 14:35:59,073 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 102 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-12-24 14:35:59,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 375 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2023-12-24 14:35:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-24 14:35:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2023-12-24 14:35:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.3624161073825503) internal successors, (203), 149 states have internal predecessors, (203), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 14:35:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 231 transitions. [2023-12-24 14:35:59,110 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 231 transitions. Word has length 85 [2023-12-24 14:35:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:35:59,111 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 231 transitions. [2023-12-24 14:35:59,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 14:35:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 231 transitions. [2023-12-24 14:35:59,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-24 14:35:59,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:35:59,112 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:35:59,125 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 14:35:59,323 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 14:35:59,325 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:35:59,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:35:59,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1706298235, now seen corresponding path program 1 times [2023-12-24 14:35:59,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:35:59,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429595308] [2023-12-24 14:35:59,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:35:59,326 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 14:35:59,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:35:59,327 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 14:35:59,330 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 14:36:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:36:00,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-24 14:36:00,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:36:00,143 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 14:36:01,724 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 36 treesize of output 27 [2023-12-24 14:36:01,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 14:36:01,984 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 72 treesize of output 40 [2023-12-24 14:36:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 14:36:02,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 14:36:02,242 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 14:36:02,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:36:02,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429595308] [2023-12-24 14:36:02,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429595308] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 14:36:02,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 14:36:02,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2023-12-24 14:36:02,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082231654] [2023-12-24 14:36:02,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:36:02,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 14:36:02,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:36:02,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 14:36:02,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-24 14:36:02,244 INFO L87 Difference]: Start difference. First operand 170 states and 231 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:36:02,462 INFO L93 Difference]: Finished difference Result 314 states and 429 transitions. [2023-12-24 14:36:02,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 14:36:02,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 87 [2023-12-24 14:36:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:36:02,463 INFO L225 Difference]: With dead ends: 314 [2023-12-24 14:36:02,463 INFO L226 Difference]: Without dead ends: 215 [2023-12-24 14:36:02,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2023-12-24 14:36:02,464 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 105 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 14:36:02,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 588 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 14:36:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-24 14:36:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 190. [2023-12-24 14:36:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.3550295857988166) internal successors, (229), 169 states have internal predecessors, (229), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 14:36:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 257 transitions. [2023-12-24 14:36:02,471 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 257 transitions. Word has length 87 [2023-12-24 14:36:02,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:36:02,471 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 257 transitions. [2023-12-24 14:36:02,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 257 transitions. [2023-12-24 14:36:02,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 14:36:02,476 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:36:02,476 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:36:02,488 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 14:36:02,676 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 14:36:02,676 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:36:02,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:36:02,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1622392496, now seen corresponding path program 1 times [2023-12-24 14:36:02,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:36:02,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722922661] [2023-12-24 14:36:02,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:36:02,677 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 14:36:02,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:36:02,680 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 14:36:02,719 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 14:36:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:36:03,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 14:36:03,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:36:04,122 INFO L349 Elim1Store]: treesize reduction 39, result has 27.8 percent of original size [2023-12-24 14:36:04,123 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 3 case distinctions, treesize of input 36 treesize of output 34 [2023-12-24 14:36:04,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 14:36:04,502 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 40 treesize of output 28 [2023-12-24 14:36:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 14:36:04,561 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 14:36:05,546 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 14:36:05,547 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 33 treesize of output 28 [2023-12-24 14:36:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-24 14:36:05,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:36:05,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722922661] [2023-12-24 14:36:05,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722922661] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 14:36:05,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 14:36:05,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2023-12-24 14:36:05,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941380789] [2023-12-24 14:36:05,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 14:36:05,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-24 14:36:05,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:36:05,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-24 14:36:05,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2023-12-24 14:36:05,591 INFO L87 Difference]: Start difference. First operand 190 states and 257 transitions. Second operand has 31 states, 27 states have (on average 4.518518518518518) internal successors, (122), 28 states have internal predecessors, (122), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-12-24 14:36:07,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:36:07,909 INFO L93 Difference]: Finished difference Result 386 states and 522 transitions. [2023-12-24 14:36:07,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-24 14:36:07,910 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 4.518518518518518) internal successors, (122), 28 states have internal predecessors, (122), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 89 [2023-12-24 14:36:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:36:07,911 INFO L225 Difference]: With dead ends: 386 [2023-12-24 14:36:07,912 INFO L226 Difference]: Without dead ends: 270 [2023-12-24 14:36:07,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=750, Invalid=2112, Unknown=0, NotChecked=0, Total=2862 [2023-12-24 14:36:07,915 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 654 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 14:36:07,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1548 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 461 Invalid, 1 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 14:36:07,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-12-24 14:36:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 214. [2023-12-24 14:36:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 193 states have (on average 1.3575129533678756) internal successors, (262), 193 states have internal predecessors, (262), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 14:36:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 290 transitions. [2023-12-24 14:36:07,933 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 290 transitions. Word has length 89 [2023-12-24 14:36:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:36:07,934 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 290 transitions. [2023-12-24 14:36:07,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 4.518518518518518) internal successors, (122), 28 states have internal predecessors, (122), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-12-24 14:36:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 290 transitions. [2023-12-24 14:36:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 14:36:07,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:36:07,936 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:36:07,949 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 14:36:08,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:36:08,149 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:36:08,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:36:08,149 INFO L85 PathProgramCache]: Analyzing trace with hash -603651675, now seen corresponding path program 1 times [2023-12-24 14:36:08,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:36:08,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628138154] [2023-12-24 14:36:08,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:36:08,150 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 14:36:08,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:36:08,151 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 14:36:08,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 14:36:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:36:08,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 14:36:08,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:36:08,593 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 21 treesize of output 9 [2023-12-24 14:36:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 14:36:08,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:36:08,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:36:08,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628138154] [2023-12-24 14:36:08,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628138154] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:36:08,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:36:08,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 14:36:08,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809608895] [2023-12-24 14:36:08,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:36:08,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 14:36:08,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:36:08,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 14:36:08,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 14:36:08,726 INFO L87 Difference]: Start difference. First operand 214 states and 290 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:36:08,913 INFO L93 Difference]: Finished difference Result 490 states and 669 transitions. [2023-12-24 14:36:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 14:36:08,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2023-12-24 14:36:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:36:08,915 INFO L225 Difference]: With dead ends: 490 [2023-12-24 14:36:08,915 INFO L226 Difference]: Without dead ends: 346 [2023-12-24 14:36:08,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 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 14:36:08,916 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 184 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 14:36:08,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 520 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 14:36:08,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-12-24 14:36:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 309. [2023-12-24 14:36:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 278 states have (on average 1.356115107913669) internal successors, (377), 278 states have internal predecessors, (377), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 14:36:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 419 transitions. [2023-12-24 14:36:08,933 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 419 transitions. Word has length 89 [2023-12-24 14:36:08,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:36:08,933 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 419 transitions. [2023-12-24 14:36:08,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:08,933 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 419 transitions. [2023-12-24 14:36:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 14:36:08,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:36:08,935 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:36:08,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 14:36:09,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:36:09,147 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:36:09,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:36:09,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1624720029, now seen corresponding path program 1 times [2023-12-24 14:36:09,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:36:09,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981752263] [2023-12-24 14:36:09,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:36:09,148 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 14:36:09,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:36:09,157 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 14:36:09,158 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 14:36:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:36:09,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 14:36:09,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:36:10,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 14:36:10,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 125 [2023-12-24 14:36:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 14:36:10,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:36:10,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:36:10,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981752263] [2023-12-24 14:36:10,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981752263] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:36:10,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:36:10,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 14:36:10,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058546918] [2023-12-24 14:36:10,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:36:10,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 14:36:10,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:36:10,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 14:36:10,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-24 14:36:10,887 INFO L87 Difference]: Start difference. First operand 309 states and 419 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:17,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 14:36:22,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 14:36:22,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:36:22,973 INFO L93 Difference]: Finished difference Result 706 states and 960 transitions. [2023-12-24 14:36:22,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 14:36:22,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2023-12-24 14:36:22,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:36:22,976 INFO L225 Difference]: With dead ends: 706 [2023-12-24 14:36:22,976 INFO L226 Difference]: Without dead ends: 471 [2023-12-24 14:36:22,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-12-24 14:36:22,977 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 95 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2023-12-24 14:36:22,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 905 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 2 Unknown, 0 Unchecked, 10.9s Time] [2023-12-24 14:36:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2023-12-24 14:36:22,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 367. [2023-12-24 14:36:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 336 states have (on average 1.3541666666666667) internal successors, (455), 336 states have internal predecessors, (455), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 14:36:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 497 transitions. [2023-12-24 14:36:22,994 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 497 transitions. Word has length 89 [2023-12-24 14:36:22,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:36:22,995 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 497 transitions. [2023-12-24 14:36:22,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 497 transitions. [2023-12-24 14:36:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 14:36:22,995 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:36:22,995 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:36:23,014 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 14:36:23,207 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 14:36:23,207 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:36:23,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:36:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash -944661659, now seen corresponding path program 1 times [2023-12-24 14:36:23,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:36:23,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222480773] [2023-12-24 14:36:23,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:36:23,208 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 14:36:23,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:36:23,209 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 14:36:23,244 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 14:36:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:36:23,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 14:36:23,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:36:24,164 INFO L349 Elim1Store]: treesize reduction 15, result has 71.7 percent of original size [2023-12-24 14:36:24,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 178 treesize of output 95 [2023-12-24 14:36:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 14:36:24,243 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:36:24,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:36:24,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222480773] [2023-12-24 14:36:24,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222480773] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:36:24,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:36:24,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 14:36:24,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876140353] [2023-12-24 14:36:24,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:36:24,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 14:36:24,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:36:24,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 14:36:24,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 14:36:24,244 INFO L87 Difference]: Start difference. First operand 367 states and 497 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:28,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 14:36:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:36:28,979 INFO L93 Difference]: Finished difference Result 756 states and 1021 transitions. [2023-12-24 14:36:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 14:36:28,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2023-12-24 14:36:28,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:36:28,982 INFO L225 Difference]: With dead ends: 756 [2023-12-24 14:36:28,982 INFO L226 Difference]: Without dead ends: 470 [2023-12-24 14:36:28,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 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 14:36:28,983 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 84 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-24 14:36:28,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 477 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2023-12-24 14:36:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-12-24 14:36:29,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 382. [2023-12-24 14:36:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 351 states have (on average 1.3418803418803418) internal successors, (471), 351 states have internal predecessors, (471), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 14:36:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 513 transitions. [2023-12-24 14:36:29,002 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 513 transitions. Word has length 89 [2023-12-24 14:36:29,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:36:29,003 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 513 transitions. [2023-12-24 14:36:29,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:29,003 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 513 transitions. [2023-12-24 14:36:29,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 14:36:29,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:36:29,003 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:36:29,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-24 14:36:29,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:36:29,216 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:36:29,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:36:29,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1852598817, now seen corresponding path program 1 times [2023-12-24 14:36:29,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:36:29,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310230866] [2023-12-24 14:36:29,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:36:29,217 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 14:36:29,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:36:29,218 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 14:36:29,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-24 14:36:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:36:29,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 14:36:29,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:36:30,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 14:36:30,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 111 [2023-12-24 14:36:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 14:36:30,145 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:36:30,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:36:30,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310230866] [2023-12-24 14:36:30,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310230866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:36:30,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:36:30,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 14:36:30,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346504624] [2023-12-24 14:36:30,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:36:30,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 14:36:30,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:36:30,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 14:36:30,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 14:36:30,147 INFO L87 Difference]: Start difference. First operand 382 states and 513 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:36:31,007 INFO L93 Difference]: Finished difference Result 768 states and 1030 transitions. [2023-12-24 14:36:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 14:36:31,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2023-12-24 14:36:31,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:36:31,010 INFO L225 Difference]: With dead ends: 768 [2023-12-24 14:36:31,010 INFO L226 Difference]: Without dead ends: 470 [2023-12-24 14:36:31,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 14:36:31,011 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 83 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 14:36:31,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 519 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 14:36:31,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-12-24 14:36:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 382. [2023-12-24 14:36:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 351 states have (on average 1.3304843304843306) internal successors, (467), 351 states have internal predecessors, (467), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 14:36:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 509 transitions. [2023-12-24 14:36:31,025 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 509 transitions. Word has length 89 [2023-12-24 14:36:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:36:31,025 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 509 transitions. [2023-12-24 14:36:31,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 509 transitions. [2023-12-24 14:36:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 14:36:31,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:36:31,026 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:36:31,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-24 14:36:31,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:36:31,238 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:36:31,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:36:31,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1762310109, now seen corresponding path program 1 times [2023-12-24 14:36:31,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:36:31,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959553051] [2023-12-24 14:36:31,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:36:31,239 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 14:36:31,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:36:31,240 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 14:36:31,257 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 14:36:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:36:31,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 14:36:31,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:36:32,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 14:36:32,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 178 treesize of output 110 [2023-12-24 14:36:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 14:36:32,335 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:36:32,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:36:32,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959553051] [2023-12-24 14:36:32,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959553051] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:36:32,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:36:32,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 14:36:32,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984924661] [2023-12-24 14:36:32,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:36:32,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 14:36:32,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:36:32,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 14:36:32,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-24 14:36:32,336 INFO L87 Difference]: Start difference. First operand 382 states and 509 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:37,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 14:36:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:36:37,966 INFO L93 Difference]: Finished difference Result 763 states and 1016 transitions. [2023-12-24 14:36:37,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 14:36:37,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2023-12-24 14:36:37,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:36:37,973 INFO L225 Difference]: With dead ends: 763 [2023-12-24 14:36:37,973 INFO L226 Difference]: Without dead ends: 465 [2023-12-24 14:36:37,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-24 14:36:37,974 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 94 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-12-24 14:36:37,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 783 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2023-12-24 14:36:37,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2023-12-24 14:36:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 376. [2023-12-24 14:36:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 345 states have (on average 1.327536231884058) internal successors, (458), 345 states have internal predecessors, (458), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 14:36:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 500 transitions. [2023-12-24 14:36:38,021 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 500 transitions. Word has length 89 [2023-12-24 14:36:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:36:38,021 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 500 transitions. [2023-12-24 14:36:38,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 500 transitions. [2023-12-24 14:36:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-24 14:36:38,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:36:38,022 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:36:38,033 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 14:36:38,235 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 14:36:38,236 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:36:38,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:36:38,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1946383743, now seen corresponding path program 1 times [2023-12-24 14:36:38,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:36:38,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687900523] [2023-12-24 14:36:38,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:36:38,236 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 14:36:38,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:36:38,238 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 14:36:38,239 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 14:36:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:36:38,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 14:36:38,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:36:38,664 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 21 treesize of output 9 [2023-12-24 14:36:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 14:36:38,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:36:38,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:36:38,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687900523] [2023-12-24 14:36:38,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687900523] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:36:38,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:36:38,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 14:36:38,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221995312] [2023-12-24 14:36:38,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:36:38,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 14:36:38,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:36:38,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 14:36:38,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 14:36:38,850 INFO L87 Difference]: Start difference. First operand 376 states and 500 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:39,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:36:39,103 INFO L93 Difference]: Finished difference Result 753 states and 1005 transitions. [2023-12-24 14:36:39,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 14:36:39,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2023-12-24 14:36:39,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:36:39,106 INFO L225 Difference]: With dead ends: 753 [2023-12-24 14:36:39,106 INFO L226 Difference]: Without dead ends: 461 [2023-12-24 14:36:39,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 14:36:39,109 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 207 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 14:36:39,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 586 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 14:36:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2023-12-24 14:36:39,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 405. [2023-12-24 14:36:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 374 states have (on average 1.320855614973262) internal successors, (494), 374 states have internal predecessors, (494), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 14:36:39,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 536 transitions. [2023-12-24 14:36:39,127 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 536 transitions. Word has length 90 [2023-12-24 14:36:39,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:36:39,127 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 536 transitions. [2023-12-24 14:36:39,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:39,128 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 536 transitions. [2023-12-24 14:36:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-24 14:36:39,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:36:39,128 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:36:39,155 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 14:36:39,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:36:39,340 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:36:39,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:36:39,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2075671999, now seen corresponding path program 1 times [2023-12-24 14:36:39,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:36:39,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977945059] [2023-12-24 14:36:39,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:36:39,341 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 14:36:39,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:36:39,342 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 14:36:39,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-24 14:36:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:36:39,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 14:36:39,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:36:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 14:36:39,771 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:36:39,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:36:39,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977945059] [2023-12-24 14:36:39,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977945059] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:36:39,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:36:39,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 14:36:39,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89805256] [2023-12-24 14:36:39,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:36:39,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 14:36:39,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:36:39,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 14:36:39,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 14:36:39,773 INFO L87 Difference]: Start difference. First operand 405 states and 536 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:36:39,885 INFO L93 Difference]: Finished difference Result 751 states and 999 transitions. [2023-12-24 14:36:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 14:36:39,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2023-12-24 14:36:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:36:39,886 INFO L225 Difference]: With dead ends: 751 [2023-12-24 14:36:39,886 INFO L226 Difference]: Without dead ends: 430 [2023-12-24 14:36:39,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-24 14:36:39,887 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 55 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 14:36:39,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 585 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 14:36:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2023-12-24 14:36:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 412. [2023-12-24 14:36:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 381 states have (on average 1.31496062992126) internal successors, (501), 381 states have internal predecessors, (501), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 14:36:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 543 transitions. [2023-12-24 14:36:39,902 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 543 transitions. Word has length 90 [2023-12-24 14:36:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:36:39,902 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 543 transitions. [2023-12-24 14:36:39,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 543 transitions. [2023-12-24 14:36:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-24 14:36:39,903 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:36:39,903 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:36:39,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-24 14:36:40,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:36:40,118 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:36:40,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:36:40,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1573857950, now seen corresponding path program 1 times [2023-12-24 14:36:40,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:36:40,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423923734] [2023-12-24 14:36:40,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:36:40,119 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 14:36:40,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:36:40,120 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 14:36:40,124 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 14:36:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:36:40,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 14:36:40,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:36:40,761 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 14:36:40,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2023-12-24 14:36:40,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2023-12-24 14:36:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 14:36:40,986 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:36:40,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:36:40,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423923734] [2023-12-24 14:36:40,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423923734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:36:40,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:36:40,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 14:36:40,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397201001] [2023-12-24 14:36:40,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:36:40,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 14:36:40,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:36:40,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 14:36:40,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-24 14:36:40,988 INFO L87 Difference]: Start difference. First operand 412 states and 543 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:36:43,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:36:47,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:36:49,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:36:53,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:36:55,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:36:58,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:00,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:02,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:05,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:08,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:12,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:14,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:37:15,104 INFO L93 Difference]: Finished difference Result 1112 states and 1467 transitions. [2023-12-24 14:37:15,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 14:37:15,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2023-12-24 14:37:15,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:37:15,109 INFO L225 Difference]: With dead ends: 1112 [2023-12-24 14:37:15,109 INFO L226 Difference]: Without dead ends: 1110 [2023-12-24 14:37:15,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2023-12-24 14:37:15,110 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 213 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.9s IncrementalHoareTripleChecker+Time [2023-12-24 14:37:15,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1124 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 33.9s Time] [2023-12-24 14:37:15,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2023-12-24 14:37:15,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 959. [2023-12-24 14:37:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 908 states have (on average 1.316079295154185) internal successors, (1195), 908 states have internal predecessors, (1195), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-24 14:37:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1265 transitions. [2023-12-24 14:37:15,146 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1265 transitions. Word has length 91 [2023-12-24 14:37:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:37:15,147 INFO L495 AbstractCegarLoop]: Abstraction has 959 states and 1265 transitions. [2023-12-24 14:37:15,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:37:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1265 transitions. [2023-12-24 14:37:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-24 14:37:15,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:37:15,148 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:37:15,185 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 14:37:15,360 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 14:37:15,361 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:37:15,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:37:15,361 INFO L85 PathProgramCache]: Analyzing trace with hash -755101849, now seen corresponding path program 1 times [2023-12-24 14:37:15,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:37:15,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722057353] [2023-12-24 14:37:15,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:37:15,362 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 14:37:15,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:37:15,384 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 14:37:15,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-24 14:37:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:37:16,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 14:37:16,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:37:16,223 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 25 treesize of output 13 [2023-12-24 14:37:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 14:37:16,237 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:37:16,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:37:16,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722057353] [2023-12-24 14:37:16,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722057353] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:37:16,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:37:16,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 14:37:16,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992934735] [2023-12-24 14:37:16,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:37:16,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 14:37:16,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:37:16,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 14:37:16,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 14:37:16,238 INFO L87 Difference]: Start difference. First operand 959 states and 1265 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:37:18,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:20,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:22,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:25,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:29,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:31,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:35,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:38,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:37:38,999 INFO L93 Difference]: Finished difference Result 1837 states and 2426 transitions. [2023-12-24 14:37:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 14:37:39,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 93 [2023-12-24 14:37:39,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:37:39,002 INFO L225 Difference]: With dead ends: 1837 [2023-12-24 14:37:39,002 INFO L226 Difference]: Without dead ends: 961 [2023-12-24 14:37:39,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 14:37:39,004 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 76 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2023-12-24 14:37:39,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 350 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 22.7s Time] [2023-12-24 14:37:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2023-12-24 14:37:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2023-12-24 14:37:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 908 states have (on average 1.3127753303964758) internal successors, (1192), 908 states have internal predecessors, (1192), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-24 14:37:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1262 transitions. [2023-12-24 14:37:39,029 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1262 transitions. Word has length 93 [2023-12-24 14:37:39,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:37:39,029 INFO L495 AbstractCegarLoop]: Abstraction has 959 states and 1262 transitions. [2023-12-24 14:37:39,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:37:39,030 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1262 transitions. [2023-12-24 14:37:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-24 14:37:39,030 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:37:39,030 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:37:39,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-24 14:37:39,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:37:39,245 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:37:39,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:37:39,245 INFO L85 PathProgramCache]: Analyzing trace with hash -614553239, now seen corresponding path program 1 times [2023-12-24 14:37:39,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:37:39,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388953149] [2023-12-24 14:37:39,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:37:39,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:37:39,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:37:39,247 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 14:37:39,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-24 14:37:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:37:39,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 14:37:39,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:37:39,988 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 19 treesize of output 15 [2023-12-24 14:37:40,136 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 64 treesize of output 48 [2023-12-24 14:37:40,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2023-12-24 14:37:40,187 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 14:37:40,187 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:37:40,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:37:40,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388953149] [2023-12-24 14:37:40,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388953149] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:37:40,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:37:40,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 14:37:40,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635726530] [2023-12-24 14:37:40,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:37:40,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 14:37:40,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:37:40,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 14:37:40,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-24 14:37:40,189 INFO L87 Difference]: Start difference. First operand 959 states and 1262 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:37:43,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:45,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:48,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:51,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:54,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:37:56,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:00,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:03,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:06,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:10,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:11,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:12,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:38:12,013 INFO L93 Difference]: Finished difference Result 976 states and 1279 transitions. [2023-12-24 14:38:12,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 14:38:12,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 93 [2023-12-24 14:38:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:38:12,016 INFO L225 Difference]: With dead ends: 976 [2023-12-24 14:38:12,016 INFO L226 Difference]: Without dead ends: 974 [2023-12-24 14:38:12,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-12-24 14:38:12,017 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 150 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.6s IncrementalHoareTripleChecker+Time [2023-12-24 14:38:12,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1254 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 255 Invalid, 1 Unknown, 0 Unchecked, 31.6s Time] [2023-12-24 14:38:12,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2023-12-24 14:38:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 749. [2023-12-24 14:38:12,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 698 states have (on average 1.313753581661891) internal successors, (917), 698 states have internal predecessors, (917), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-24 14:38:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 987 transitions. [2023-12-24 14:38:12,044 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 987 transitions. Word has length 93 [2023-12-24 14:38:12,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:38:12,044 INFO L495 AbstractCegarLoop]: Abstraction has 749 states and 987 transitions. [2023-12-24 14:38:12,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:38:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 987 transitions. [2023-12-24 14:38:12,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-24 14:38:12,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:38:12,045 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:38:12,068 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 (20)] Ended with exit code 0 [2023-12-24 14:38:12,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:38:12,260 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:38:12,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:38:12,260 INFO L85 PathProgramCache]: Analyzing trace with hash -454379415, now seen corresponding path program 1 times [2023-12-24 14:38:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:38:12,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239828183] [2023-12-24 14:38:12,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:38:12,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:38:12,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:38:12,262 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 14:38:12,269 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 14:38:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:38:12,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 14:38:12,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:38:12,989 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 14:38:13,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2023-12-24 14:38:13,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-24 14:38:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 14:38:13,212 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:38:13,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:38:13,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239828183] [2023-12-24 14:38:13,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239828183] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:38:13,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:38:13,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 14:38:13,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199802060] [2023-12-24 14:38:13,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:38:13,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 14:38:13,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:38:13,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 14:38:13,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-24 14:38:13,213 INFO L87 Difference]: Start difference. First operand 749 states and 987 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:38:15,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:18,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:20,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:24,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:27,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:31,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:36,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:38,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:41,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:43,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:47,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:49,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:38:49,452 INFO L93 Difference]: Finished difference Result 1124 states and 1472 transitions. [2023-12-24 14:38:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 14:38:49,453 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 93 [2023-12-24 14:38:49,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:38:49,455 INFO L225 Difference]: With dead ends: 1124 [2023-12-24 14:38:49,455 INFO L226 Difference]: Without dead ends: 1122 [2023-12-24 14:38:49,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2023-12-24 14:38:49,456 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 247 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.9s IncrementalHoareTripleChecker+Time [2023-12-24 14:38:49,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1451 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 292 Invalid, 1 Unknown, 0 Unchecked, 35.9s Time] [2023-12-24 14:38:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2023-12-24 14:38:49,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 963. [2023-12-24 14:38:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 912 states have (on average 1.3135964912280702) internal successors, (1198), 912 states have internal predecessors, (1198), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-24 14:38:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1268 transitions. [2023-12-24 14:38:49,485 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1268 transitions. Word has length 93 [2023-12-24 14:38:49,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:38:49,485 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1268 transitions. [2023-12-24 14:38:49,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:38:49,485 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1268 transitions. [2023-12-24 14:38:49,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-24 14:38:49,486 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:38:49,486 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:38:49,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-24 14:38:49,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:38:49,701 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:38:49,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:38:49,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1980520784, now seen corresponding path program 1 times [2023-12-24 14:38:49,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:38:49,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878622236] [2023-12-24 14:38:49,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:38:49,702 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 14:38:49,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:38:49,703 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 14:38:49,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-24 14:38:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:38:50,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 14:38:50,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:38:50,405 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 19 treesize of output 15 [2023-12-24 14:38:50,516 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 24 treesize of output 16 [2023-12-24 14:38:50,537 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 30 treesize of output 18 [2023-12-24 14:38:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 14:38:50,606 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:38:50,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:38:50,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878622236] [2023-12-24 14:38:50,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878622236] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:38:50,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:38:50,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 14:38:50,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14996261] [2023-12-24 14:38:50,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:38:50,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 14:38:50,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:38:50,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 14:38:50,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-24 14:38:50,607 INFO L87 Difference]: Start difference. First operand 963 states and 1268 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:38:52,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:55,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:38:57,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:00,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:04,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:06,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:09,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:13,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:17,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:20,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:20,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:39:20,599 INFO L93 Difference]: Finished difference Result 982 states and 1287 transitions. [2023-12-24 14:39:20,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-24 14:39:20,599 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 95 [2023-12-24 14:39:20,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:39:20,601 INFO L225 Difference]: With dead ends: 982 [2023-12-24 14:39:20,601 INFO L226 Difference]: Without dead ends: 980 [2023-12-24 14:39:20,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2023-12-24 14:39:20,602 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 192 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.6s IncrementalHoareTripleChecker+Time [2023-12-24 14:39:20,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1540 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 29.6s Time] [2023-12-24 14:39:20,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2023-12-24 14:39:20,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 745. [2023-12-24 14:39:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 694 states have (on average 1.3155619596541788) internal successors, (913), 694 states have internal predecessors, (913), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-24 14:39:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 983 transitions. [2023-12-24 14:39:20,626 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 983 transitions. Word has length 95 [2023-12-24 14:39:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:39:20,627 INFO L495 AbstractCegarLoop]: Abstraction has 745 states and 983 transitions. [2023-12-24 14:39:20,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:39:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 983 transitions. [2023-12-24 14:39:20,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-24 14:39:20,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:39:20,628 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 14:39:20,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-24 14:39:20,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:39:20,842 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:39:20,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:39:20,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2057699511, now seen corresponding path program 1 times [2023-12-24 14:39:20,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:39:20,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919510488] [2023-12-24 14:39:20,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:39:20,843 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 14:39:20,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:39:20,844 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 14:39:20,860 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 14:39:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:39:21,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 14:39:21,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:39:22,302 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 26 treesize of output 18 [2023-12-24 14:39:22,305 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 14 treesize of output 10 [2023-12-24 14:39:22,371 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 19 treesize of output 11 [2023-12-24 14:39:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 15 proven. 231 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-12-24 14:39:22,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 14:39:26,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2023-12-24 14:39:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 15 proven. 35 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 14:39:30,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:39:30,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919510488] [2023-12-24 14:39:30,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919510488] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 14:39:30,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 14:39:30,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-24 14:39:30,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620571355] [2023-12-24 14:39:30,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 14:39:30,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 14:39:30,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:39:30,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 14:39:30,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-24 14:39:30,506 INFO L87 Difference]: Start difference. First operand 745 states and 983 transitions. Second operand has 8 states, 8 states have (on average 24.125) internal successors, (193), 8 states have internal predecessors, (193), 4 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2023-12-24 14:39:35,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:36,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:39,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:42,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:45,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:46,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:48,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:50,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:53,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:54,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:39:57,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:00,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:03,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:07,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:09,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:11,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:15,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:17,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:21,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:24,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:26,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:31,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:34,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:37,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:42,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:44,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:45,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:48,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:52,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:54,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:40:58,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:41:01,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:41:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:41:02,185 INFO L93 Difference]: Finished difference Result 2883 states and 3798 transitions. [2023-12-24 14:41:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 14:41:02,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.125) internal successors, (193), 8 states have internal predecessors, (193), 4 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 170 [2023-12-24 14:41:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:41:02,195 INFO L225 Difference]: With dead ends: 2883 [2023-12-24 14:41:02,196 INFO L226 Difference]: Without dead ends: 2222 [2023-12-24 14:41:02,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2023-12-24 14:41:02,197 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 1068 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 81 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 89.3s IncrementalHoareTripleChecker+Time [2023-12-24 14:41:02,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 909 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 303 Invalid, 2 Unknown, 0 Unchecked, 89.3s Time] [2023-12-24 14:41:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2023-12-24 14:41:02,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 1790. [2023-12-24 14:41:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1689 states have (on average 1.2865600947306097) internal successors, (2173), 1689 states have internal predecessors, (2173), 70 states have call successors, (70), 30 states have call predecessors, (70), 30 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-24 14:41:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2313 transitions. [2023-12-24 14:41:02,271 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2313 transitions. Word has length 170 [2023-12-24 14:41:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:41:02,271 INFO L495 AbstractCegarLoop]: Abstraction has 1790 states and 2313 transitions. [2023-12-24 14:41:02,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.125) internal successors, (193), 8 states have internal predecessors, (193), 4 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2023-12-24 14:41:02,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2313 transitions. [2023-12-24 14:41:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-24 14:41:02,273 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:41:02,273 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 14:41:02,298 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 14:41:02,496 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 14:41:02,496 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:41:02,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:41:02,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1231981470, now seen corresponding path program 1 times [2023-12-24 14:41:02,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:41:02,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841577034] [2023-12-24 14:41:02,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:41:02,497 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 14:41:02,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:41:02,498 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 14:41:02,500 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 14:41:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:41:03,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 14:41:03,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:41:04,149 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 14:41:04,172 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 16 treesize of output 12 [2023-12-24 14:41:04,245 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 21 treesize of output 13 [2023-12-24 14:41:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 15 proven. 231 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-12-24 14:41:04,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 14:41:09,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2023-12-24 14:41:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 15 proven. 35 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 14:41:14,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:41:14,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841577034] [2023-12-24 14:41:14,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841577034] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 14:41:14,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 14:41:14,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-12-24 14:41:14,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940590973] [2023-12-24 14:41:14,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 14:41:14,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 14:41:14,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:41:14,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 14:41:14,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-24 14:41:14,557 INFO L87 Difference]: Start difference. First operand 1790 states and 2313 transitions. Second operand has 10 states, 10 states have (on average 19.7) internal successors, (197), 10 states have internal predecessors, (197), 4 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2023-12-24 14:41:20,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:41:22,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:41:26,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:41:30,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:41:31,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:41:36,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:41:38,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:41:40,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:41:44,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:41:45,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:41:49,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:41:50,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 14:41:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:41:50,783 INFO L93 Difference]: Finished difference Result 2653 states and 3373 transitions. [2023-12-24 14:41:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 14:41:50,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.7) internal successors, (197), 10 states have internal predecessors, (197), 4 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 172 [2023-12-24 14:41:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:41:50,786 INFO L225 Difference]: With dead ends: 2653 [2023-12-24 14:41:50,786 INFO L226 Difference]: Without dead ends: 864 [2023-12-24 14:41:50,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-24 14:41:50,788 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 400 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2023-12-24 14:41:50,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 637 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 34.7s Time] [2023-12-24 14:41:50,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2023-12-24 14:41:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 277. [2023-12-24 14:41:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 256 states have (on average 1.203125) internal successors, (308), 256 states have internal predecessors, (308), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 14:41:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 336 transitions. [2023-12-24 14:41:50,804 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 336 transitions. Word has length 172 [2023-12-24 14:41:50,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:41:50,805 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 336 transitions. [2023-12-24 14:41:50,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.7) internal successors, (197), 10 states have internal predecessors, (197), 4 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2023-12-24 14:41:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 336 transitions. [2023-12-24 14:41:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-12-24 14:41:50,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:41:50,806 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 14:41:50,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-24 14:41:51,027 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 14:41:51,028 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:41:51,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:41:51,028 INFO L85 PathProgramCache]: Analyzing trace with hash -871907995, now seen corresponding path program 1 times [2023-12-24 14:41:51,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:41:51,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021591377] [2023-12-24 14:41:51,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:41:51,029 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 14:41:51,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:41:51,031 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 14:41:51,060 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 14:41:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:41:51,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 14:41:51,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:41:52,902 INFO L349 Elim1Store]: treesize reduction 15, result has 71.7 percent of original size [2023-12-24 14:41:52,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 111 [2023-12-24 14:41:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2023-12-24 14:41:53,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:41:53,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:41:53,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021591377] [2023-12-24 14:41:53,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021591377] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:41:53,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:41:53,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 14:41:53,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292150077] [2023-12-24 14:41:53,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:41:53,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 14:41:53,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:41:53,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 14:41:53,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-24 14:41:53,170 INFO L87 Difference]: Start difference. First operand 277 states and 336 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:41:59,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 14:41:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:41:59,902 INFO L93 Difference]: Finished difference Result 464 states and 562 transitions. [2023-12-24 14:41:59,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 14:41:59,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 180 [2023-12-24 14:41:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:41:59,906 INFO L225 Difference]: With dead ends: 464 [2023-12-24 14:41:59,906 INFO L226 Difference]: Without dead ends: 306 [2023-12-24 14:41:59,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-12-24 14:41:59,906 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 55 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-24 14:41:59,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 576 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2023-12-24 14:41:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-12-24 14:41:59,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 272. [2023-12-24 14:41:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 251 states have (on average 1.207171314741036) internal successors, (303), 251 states have internal predecessors, (303), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 14:41:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 331 transitions. [2023-12-24 14:41:59,925 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 331 transitions. Word has length 180 [2023-12-24 14:41:59,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:41:59,925 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 331 transitions. [2023-12-24 14:41:59,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:41:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 331 transitions. [2023-12-24 14:41:59,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-12-24 14:41:59,927 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:41:59,927 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 14:41:59,959 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 14:42:00,149 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 14:42:00,149 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:42:00,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:42:00,150 INFO L85 PathProgramCache]: Analyzing trace with hash -191040731, now seen corresponding path program 1 times [2023-12-24 14:42:00,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:42:00,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024863692] [2023-12-24 14:42:00,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:42:00,150 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 14:42:00,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:42:00,152 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 14:42:00,154 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 14:42:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:42:01,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 14:42:01,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:42:01,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 14:42:01,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 111 [2023-12-24 14:42:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2023-12-24 14:42:01,713 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:42:01,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:42:01,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024863692] [2023-12-24 14:42:01,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024863692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:42:01,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:42:01,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 14:42:01,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985405177] [2023-12-24 14:42:01,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:42:01,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 14:42:01,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:42:01,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 14:42:01,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-24 14:42:01,715 INFO L87 Difference]: Start difference. First operand 272 states and 331 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:42:06,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 14:42:07,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:42:07,041 INFO L93 Difference]: Finished difference Result 456 states and 552 transitions. [2023-12-24 14:42:07,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 14:42:07,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 180 [2023-12-24 14:42:07,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:42:07,044 INFO L225 Difference]: With dead ends: 456 [2023-12-24 14:42:07,044 INFO L226 Difference]: Without dead ends: 296 [2023-12-24 14:42:07,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-24 14:42:07,045 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 51 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-24 14:42:07,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 550 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2023-12-24 14:42:07,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-12-24 14:42:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 260. [2023-12-24 14:42:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 239 states have (on average 1.209205020920502) internal successors, (289), 239 states have internal predecessors, (289), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 14:42:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 317 transitions. [2023-12-24 14:42:07,068 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 317 transitions. Word has length 180 [2023-12-24 14:42:07,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:42:07,068 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 317 transitions. [2023-12-24 14:42:07,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:42:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 317 transitions. [2023-12-24 14:42:07,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-12-24 14:42:07,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:42:07,070 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 14:42:07,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-24 14:42:07,287 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 14:42:07,288 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:42:07,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:42:07,288 INFO L85 PathProgramCache]: Analyzing trace with hash 686930301, now seen corresponding path program 1 times [2023-12-24 14:42:07,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:42:07,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146237005] [2023-12-24 14:42:07,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:42:07,289 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 14:42:07,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:42:07,296 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 14:42:07,297 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 14:42:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:42:08,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 14:42:08,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:42:10,482 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 0 case distinctions, treesize of input 38 treesize of output 29 [2023-12-24 14:42:10,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 14:42:10,745 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 44 treesize of output 20 [2023-12-24 14:42:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 28 proven. 269 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-24 14:42:11,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 14:42:12,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 14:42:12,785 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 65 treesize of output 71 [2023-12-24 14:42:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 17 proven. 115 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2023-12-24 14:42:12,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:42:12,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146237005] [2023-12-24 14:42:12,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146237005] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 14:42:12,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 14:42:12,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-12-24 14:42:12,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332399433] [2023-12-24 14:42:12,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 14:42:12,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 14:42:12,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:42:12,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 14:42:12,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2023-12-24 14:42:12,931 INFO L87 Difference]: Start difference. First operand 260 states and 317 transitions. Second operand has 24 states, 20 states have (on average 11.2) internal successors, (224), 22 states have internal predecessors, (224), 8 states have call successors, (28), 5 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) [2023-12-24 14:42:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:42:15,620 INFO L93 Difference]: Finished difference Result 570 states and 696 transitions. [2023-12-24 14:42:15,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-24 14:42:15,621 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 11.2) internal successors, (224), 22 states have internal predecessors, (224), 8 states have call successors, (28), 5 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) Word has length 182 [2023-12-24 14:42:15,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:42:15,622 INFO L225 Difference]: With dead ends: 570 [2023-12-24 14:42:15,622 INFO L226 Difference]: Without dead ends: 413 [2023-12-24 14:42:15,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=539, Invalid=1717, Unknown=0, NotChecked=0, Total=2256 [2023-12-24 14:42:15,623 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 512 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 14:42:15,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1457 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 14:42:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2023-12-24 14:42:15,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 341. [2023-12-24 14:42:15,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 310 states have (on average 1.2161290322580645) internal successors, (377), 310 states have internal predecessors, (377), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 14:42:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 419 transitions. [2023-12-24 14:42:15,643 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 419 transitions. Word has length 182 [2023-12-24 14:42:15,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:42:15,643 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 419 transitions. [2023-12-24 14:42:15,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 11.2) internal successors, (224), 22 states have internal predecessors, (224), 8 states have call successors, (28), 5 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) [2023-12-24 14:42:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 419 transitions. [2023-12-24 14:42:15,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-12-24 14:42:15,644 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:42:15,645 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 14:42:15,668 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 14:42:15,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:42:15,866 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:42:15,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:42:15,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1101444803, now seen corresponding path program 1 times [2023-12-24 14:42:15,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:42:15,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505622384] [2023-12-24 14:42:15,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:42:15,867 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 14:42:15,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:42:15,870 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 14:42:15,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-24 14:42:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:42:16,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 14:42:16,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:42:16,730 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 14:42:16,774 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 37 treesize of output 25 [2023-12-24 14:42:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2023-12-24 14:42:16,823 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 14:42:16,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:42:16,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505622384] [2023-12-24 14:42:16,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505622384] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 14:42:16,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 14:42:16,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 14:42:16,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56760474] [2023-12-24 14:42:16,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 14:42:16,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 14:42:16,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:42:16,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 14:42:16,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 14:42:16,825 INFO L87 Difference]: Start difference. First operand 341 states and 419 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:42:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:42:17,112 INFO L93 Difference]: Finished difference Result 596 states and 733 transitions. [2023-12-24 14:42:17,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 14:42:17,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 182 [2023-12-24 14:42:17,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:42:17,113 INFO L225 Difference]: With dead ends: 596 [2023-12-24 14:42:17,113 INFO L226 Difference]: Without dead ends: 358 [2023-12-24 14:42:17,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-12-24 14:42:17,114 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 77 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 14:42:17,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 700 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 14:42:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-12-24 14:42:17,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 337. [2023-12-24 14:42:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 306 states have (on average 1.2156862745098038) internal successors, (372), 306 states have internal predecessors, (372), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 14:42:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 414 transitions. [2023-12-24 14:42:17,137 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 414 transitions. Word has length 182 [2023-12-24 14:42:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:42:17,137 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 414 transitions. [2023-12-24 14:42:17,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 14:42:17,138 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 414 transitions. [2023-12-24 14:42:17,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2023-12-24 14:42:17,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 14:42:17,139 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 14:42:17,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-12-24 14:42:17,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 14:42:17,344 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 14:42:17,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 14:42:17,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1473529267, now seen corresponding path program 1 times [2023-12-24 14:42:17,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 14:42:17,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18344530] [2023-12-24 14:42:17,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 14:42:17,345 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 14:42:17,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 14:42:17,346 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 14:42:17,347 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 14:42:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 14:42:18,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 14:42:18,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 14:42:19,822 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 14 treesize of output 10 [2023-12-24 14:42:19,912 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 21 treesize of output 9 [2023-12-24 14:42:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 12 proven. 516 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2023-12-24 14:42:20,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 14:42:20,382 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 28 [2023-12-24 14:42:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 12 proven. 124 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2023-12-24 14:42:21,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 14:42:21,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18344530] [2023-12-24 14:42:21,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18344530] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 14:42:21,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 14:42:21,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2023-12-24 14:42:21,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084060640] [2023-12-24 14:42:21,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 14:42:21,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 14:42:21,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 14:42:21,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 14:42:21,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-24 14:42:21,396 INFO L87 Difference]: Start difference. First operand 337 states and 414 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 2 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-12-24 14:42:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 14:42:21,789 INFO L93 Difference]: Finished difference Result 636 states and 774 transitions. [2023-12-24 14:42:21,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 14:42:21,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 2 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 275 [2023-12-24 14:42:21,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 14:42:21,791 INFO L225 Difference]: With dead ends: 636 [2023-12-24 14:42:21,791 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 14:42:21,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 543 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-24 14:42:21,792 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 312 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 14:42:21,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 454 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 14:42:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 14:42:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 14:42:21,792 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 14:42:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 14:42:21,792 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 275 [2023-12-24 14:42:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 14:42:21,792 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 14:42:21,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 2 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-12-24 14:42:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 14:42:21,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 14:42:21,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 14:42:21,839 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 14:42:22,012 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 14:42:22,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 14:43:48,093 WARN L293 SmtUtils]: Spent 1.43m on a formula simplification. DAG size of input: 246 DAG size of output: 195 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 14:44:01,355 WARN L293 SmtUtils]: Spent 10.92s on a formula simplification. DAG size of input: 195 DAG size of output: 112 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 14:44:12,506 WARN L293 SmtUtils]: Spent 5.00s on a formula simplification. DAG size of input: 197 DAG size of output: 136 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 14:44:53,663 WARN L293 SmtUtils]: Spent 35.62s on a formula simplification. DAG size of input: 340 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 14:44:53,666 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 14:44:53,666 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 14:44:53,666 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 14:44:53,666 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 14:44:53,666 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 56) no Hoare annotation was computed. [2023-12-24 14:44:53,666 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 14:44:53,666 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 14:44:53,666 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 14:44:53,666 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2023-12-24 14:44:53,666 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 55) no Hoare annotation was computed. [2023-12-24 14:44:53,666 INFO L899 garLoopResultBuilder]: For program point L86-2(line 86) no Hoare annotation was computed. [2023-12-24 14:44:53,666 INFO L899 garLoopResultBuilder]: For program point L86-3(line 86) no Hoare annotation was computed. [2023-12-24 14:44:53,666 INFO L899 garLoopResultBuilder]: For program point L86-5(line 86) no Hoare annotation was computed. [2023-12-24 14:44:53,666 INFO L899 garLoopResultBuilder]: For program point L86-7(line 86) no Hoare annotation was computed. [2023-12-24 14:44:53,667 INFO L895 garLoopResultBuilder]: At program point L86-8(line 86) the Hoare annotation is: (let ((.cse23 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse24 ((_ sign_extend 16) (_ bv32 16)))) (let ((.cse21 ((_ extract 15 0) .cse24)) (.cse17 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) (.cse22 ((_ 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_0Var0_Pointer~0.offset)))) (.cse20 (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) .cse23)) (.cse25 ((_ sign_extend 24) (_ bv0 8)))) (let ((.cse12 (= ((_ extract 7 0) .cse25) ~last_1_BOOL_unsigned_char_Array_0_1_~0)) (.cse15 (= .cse25 .cse20)) (.cse0 (= .cse24 (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (.cse1 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset))) (_ bv1 32))) (.cse2 (bvsge .cse22 (_ bv1 32))) (.cse3 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset .cse23)) (.cse4 (not |ULTIMATE.start_updateVariables_#t~short56#1|)) (.cse5 (bvsle .cse22 (_ bv1 32))) (.cse6 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse7 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base |~#signed_short_int_Array_0~0.base|)) (.cse8 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse9 (= |~#BOOL_unsigned_char_Array_0~0.offset| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)) (.cse10 (= |~#signed_short_int_Array_0~0.offset| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)) (.cse11 (= ((_ sign_extend 16) .cse21) .cse17)) (.cse13 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) .cse21)))))) (.cse14 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse16 ((_ sign_extend 16) (_ bv256 16)))) (and .cse0 .cse1 .cse2 .cse3 (= .cse16 .cse17) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse16)) .cse14 .cse15)) (and (exists ((v_arrayElimCell_58 (_ BitVec 32))) (let ((.cse18 ((_ extract 7 0) v_arrayElimCell_58))) (let ((.cse19 ((_ zero_extend 24) .cse18))) (and (= ((_ extract 7 0) ((_ sign_extend 24) .cse18)) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (bvsge .cse19 (_ bv1 32)) (bvsle .cse19 (_ bv1 32)))))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ((_ extract 7 0) .cse20) (_ bv0 8))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14))))) [2023-12-24 14:44:53,667 INFO L899 garLoopResultBuilder]: For program point L86-9(line 86) no Hoare annotation was computed. [2023-12-24 14:44:53,667 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-12-24 14:44:53,667 INFO L899 garLoopResultBuilder]: For program point L88-2(line 88) no Hoare annotation was computed. [2023-12-24 14:44:53,667 INFO L899 garLoopResultBuilder]: For program point L88-3(line 88) no Hoare annotation was computed. [2023-12-24 14:44:53,667 INFO L899 garLoopResultBuilder]: For program point L88-5(line 88) no Hoare annotation was computed. [2023-12-24 14:44:53,667 INFO L899 garLoopResultBuilder]: For program point L88-7(line 88) no Hoare annotation was computed. [2023-12-24 14:44:53,667 INFO L895 garLoopResultBuilder]: At program point L88-8(line 88) the Hoare annotation is: (let ((.cse23 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse22 ((_ 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_0Var0_Pointer~0.offset)))) (.cse20 ((_ sign_extend 16) (_ bv32 16))) (.cse21 (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset)) (.cse19 (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) .cse23)) (.cse24 ((_ sign_extend 24) (_ bv0 8)))) (let ((.cse12 (= ((_ extract 7 0) .cse24) ~last_1_BOOL_unsigned_char_Array_0_1_~0)) (.cse15 (= .cse24 .cse19)) (.cse0 (= .cse20 .cse21)) (.cse1 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset))) (_ bv1 32))) (.cse2 (bvsge .cse22 (_ bv1 32))) (.cse3 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset .cse23)) (.cse4 (bvsle .cse22 (_ bv1 32))) (.cse5 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse6 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base |~#signed_short_int_Array_0~0.base|)) (.cse7 (= ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) .cse21)))) (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))) (.cse8 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse9 (= |~#BOOL_unsigned_char_Array_0~0.offset| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)) (.cse10 (= |~#signed_short_int_Array_0~0.offset| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)) (.cse11 (not |ULTIMATE.start_updateVariables_#t~short64#1|)) (.cse13 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) .cse20))))))) (.cse14 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse16 ((_ sign_extend 16) (_ bv256 16)))) (and .cse0 .cse1 .cse2 .cse3 (= .cse16 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse16)) .cse14 .cse15)) (and (exists ((v_arrayElimCell_58 (_ BitVec 32))) (let ((.cse17 ((_ extract 7 0) v_arrayElimCell_58))) (let ((.cse18 ((_ zero_extend 24) .cse17))) (and (= ((_ extract 7 0) ((_ sign_extend 24) .cse17)) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (bvsge .cse18 (_ bv1 32)) (bvsle .cse18 (_ bv1 32)))))) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ((_ extract 7 0) .cse19) (_ bv0 8))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14))))) [2023-12-24 14:44:53,667 INFO L899 garLoopResultBuilder]: For program point L88-9(line 88) no Hoare annotation was computed. [2023-12-24 14:44:53,667 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 14:44:53,668 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 66) no Hoare annotation was computed. [2023-12-24 14:44:53,668 INFO L899 garLoopResultBuilder]: For program point L60-1(lines 60 66) no Hoare annotation was computed. [2023-12-24 14:44:53,668 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse29 ((_ sign_extend 16) (_ bv32 16)))) (let ((.cse11 ((_ extract 15 0) .cse29))) (let ((.cse27 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse14 ((_ sign_extend 16) .cse11)) (.cse16 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) (.cse28 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse2 (= .cse29 (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (.cse3 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset .cse28)) (.cse10 (= .cse14 .cse16)) (.cse13 (= currentRoundingMode roundNearestTiesToEven)) (.cse5 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse6 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base |~#signed_short_int_Array_0~0.base|)) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse8 (= |~#BOOL_unsigned_char_Array_0~0.offset| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)) (.cse9 (= |~#signed_short_int_Array_0~0.offset| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)) (.cse12 (= ((_ extract 7 0) (select .cse27 |~#BOOL_unsigned_char_Array_0~0.offset|)) |ULTIMATE.start_updateVariables_#t~mem27#1|)) (.cse4 (select .cse27 .cse28))) (or (and (exists ((v_arrayElimCell_58 (_ BitVec 32))) (let ((.cse0 ((_ extract 7 0) v_arrayElimCell_58))) (let ((.cse1 ((_ zero_extend 24) .cse0))) (and (= ((_ extract 7 0) ((_ sign_extend 24) .cse0)) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (bvsge .cse1 (_ bv1 32)) (bvsle .cse1 (_ bv1 32)))))) .cse2 .cse3 (not (= ((_ extract 7 0) .cse4) (_ bv0 8))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) .cse11))))) .cse12 .cse13) (let ((.cse26 ((_ sign_extend 24) (_ bv0 8)))) (and .cse2 .cse3 (or (and (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse14)) .cse10 .cse13) (let ((.cse15 ((_ sign_extend 16) (_ bv256 16))) (.cse17 (let ((.cse24 (let ((.cse25 (select |#memory_int#2| ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse25 (bvadd (_ bv4 32) ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset)) (select .cse25 ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse24) ((_ extract 62 52) .cse24) ((_ extract 51 0) .cse24)))) (.cse18 (let ((.cse22 (let ((.cse23 (select |#memory_int#2| ~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse23 (bvadd (_ bv4 32) ~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset)) (select .cse23 ~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse22) ((_ extract 62 52) .cse22) ((_ extract 51 0) .cse22)))) (.cse19 (let ((.cse20 (let ((.cse21 (select |#memory_int#2| ~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base))) (concat (select .cse21 (bvadd (_ bv4 32) ~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.offset)) (select .cse21 ~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse20) ((_ extract 62 52) .cse20) ((_ extract 51 0) .cse20))))) (and (= .cse15 .cse16) (not (fp.lt .cse17 .cse18)) (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse15)) (fp.leq .cse17 .cse19) (exists ((|ULTIMATE.start_step_#t~mem17#1| (_ FloatingPoint 11 53))) (fp.lt .cse17 |ULTIMATE.start_step_#t~mem17#1|)) .cse13 (fp.leq .cse18 .cse19)))) .cse5 .cse6 .cse7 .cse8 .cse9 (= ((_ extract 7 0) .cse26) ~last_1_BOOL_unsigned_char_Array_0_1_~0) .cse12 (= .cse26 .cse4)))))))) [2023-12-24 14:44:53,668 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-12-24 14:44:53,668 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 65) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (let ((.cse30 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse31 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse0 ((_ extract 7 0) (select .cse30 |~#BOOL_unsigned_char_Array_0~0.offset|))) (.cse29 ((_ sign_extend 16) (_ bv32 16))) (.cse28 (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (let ((.cse3 (= .cse29 .cse28)) (.cse1 (bvsge ((_ zero_extend 24) .cse0) (_ bv1 32))) (.cse2 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset .cse31)) (.cse5 (= |ULTIMATE.start_updateVariables_#t~mem28#1| ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)))) (.cse25 (select .cse30 .cse31)) (.cse6 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base |~#signed_short_int_Array_0~0.base|)) (.cse22 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse23 (= |~#BOOL_unsigned_char_Array_0~0.offset| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)) (.cse7 (= |~#signed_short_int_Array_0~0.offset| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)) (.cse11 ((_ extract 15 0) .cse29)) (.cse9 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse10 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse24 ((_ sign_extend 24) (_ bv0 8)))) (and (= .cse0 |ULTIMATE.start_updateVariables_#t~mem28#1|) .cse1 .cse2 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base) (let ((.cse8 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|))) (or (let ((.cse4 ((_ sign_extend 16) .cse11))) (and .cse3 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse4)) .cse5 .cse6 .cse7 (= .cse4 .cse8) .cse9 .cse10)) (let ((.cse12 ((_ sign_extend 16) (_ bv256 16))) (.cse13 (let ((.cse20 (let ((.cse21 (select |#memory_int#2| ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse21 (bvadd (_ bv4 32) ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset)) (select .cse21 ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse20) ((_ extract 62 52) .cse20) ((_ extract 51 0) .cse20)))) (.cse14 (let ((.cse18 (let ((.cse19 (select |#memory_int#2| ~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse19 (bvadd (_ bv4 32) ~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset)) (select .cse19 ~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse18) ((_ extract 62 52) .cse18) ((_ extract 51 0) .cse18)))) (.cse15 (let ((.cse16 (let ((.cse17 (select |#memory_int#2| ~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base))) (concat (select .cse17 (bvadd (_ bv4 32) ~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.offset)) (select .cse17 ~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse16) ((_ extract 62 52) .cse16) ((_ extract 51 0) .cse16))))) (and .cse3 (= .cse12 .cse8) .cse6 (not (fp.lt .cse13 .cse14)) .cse7 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse12)) (fp.leq .cse13 .cse15) (exists ((|ULTIMATE.start_step_#t~mem17#1| (_ FloatingPoint 11 53))) (fp.lt .cse13 |ULTIMATE.start_step_#t~mem17#1|)) .cse10 (fp.leq .cse14 .cse15))))) .cse22 .cse23 (= ((_ extract 7 0) .cse24) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (= .cse24 .cse25))) (and (exists ((v_arrayElimCell_58 (_ BitVec 32))) (let ((.cse26 ((_ extract 7 0) v_arrayElimCell_58))) (let ((.cse27 ((_ zero_extend 24) .cse26))) (and (= ((_ extract 7 0) ((_ sign_extend 24) .cse26)) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (bvsge .cse27 (_ bv1 32)) (bvsle .cse27 (_ bv1 32)))))) .cse3 .cse1 .cse2 .cse5 (not (= ((_ extract 7 0) .cse25) (_ bv0 8))) .cse6 (= ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) .cse28)))) (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)) .cse22 .cse23 .cse7 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) .cse11))))) .cse9 .cse10))))) [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L95-1(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L95-2(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L62-2(line 62) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L95-4(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L95-6(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L95-8(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L95-9(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L95-10(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L95-12(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L95-13(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L95-14(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L95-16(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L95-18(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L95-20(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 14:44:53,669 INFO L899 garLoopResultBuilder]: For program point L95-22(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,670 INFO L899 garLoopResultBuilder]: For program point L95-23(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,670 INFO L899 garLoopResultBuilder]: For program point L95-24(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,670 INFO L899 garLoopResultBuilder]: For program point L95-25(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,670 INFO L899 garLoopResultBuilder]: For program point L95-26(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,670 INFO L899 garLoopResultBuilder]: For program point L95-28(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,670 INFO L899 garLoopResultBuilder]: For program point L95-30(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,670 INFO L899 garLoopResultBuilder]: For program point L95-32(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,670 INFO L899 garLoopResultBuilder]: For program point L95-34(line 95) no Hoare annotation was computed. [2023-12-24 14:44:53,670 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-24 14:44:53,670 INFO L899 garLoopResultBuilder]: For program point L80-2(line 80) no Hoare annotation was computed. [2023-12-24 14:44:53,670 INFO L899 garLoopResultBuilder]: For program point L80-3(line 80) no Hoare annotation was computed. [2023-12-24 14:44:53,670 INFO L899 garLoopResultBuilder]: For program point L80-5(line 80) no Hoare annotation was computed. [2023-12-24 14:44:53,670 INFO L899 garLoopResultBuilder]: For program point L80-7(line 80) no Hoare annotation was computed. [2023-12-24 14:44:53,670 INFO L895 garLoopResultBuilder]: At program point L80-8(line 80) the Hoare annotation is: (let ((.cse15 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse22 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse23 ((_ 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_0Var0_Pointer~0.offset)))) (.cse21 ((_ sign_extend 16) (_ bv32 16))) (.cse20 (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (let ((.cse0 (= .cse21 .cse20)) (.cse8 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset))) (_ bv1 32))) (.cse1 (bvsge .cse23 (_ bv1 32))) (.cse11 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset .cse22)) (.cse9 (bvsle .cse23 (_ bv1 32))) (.cse17 (select .cse15 .cse22)) (.cse12 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse4 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base |~#signed_short_int_Array_0~0.base|)) (.cse13 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.offset| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)) (.cse5 (= |~#signed_short_int_Array_0~0.offset| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)) (.cse10 ((_ extract 15 0) .cse21)) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse16 ((_ sign_extend 24) (_ bv0 8)))) (and (let ((.cse3 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|))) (or (let ((.cse2 ((_ sign_extend 16) (_ bv256 16)))) (and .cse0 .cse1 (= .cse2 .cse3) .cse4 .cse5 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse2)) .cse6)) (let ((.cse7 ((_ sign_extend 16) .cse10))) (and .cse0 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse7)) .cse8 .cse1 .cse9 .cse4 .cse5 (= .cse7 .cse3) .cse6)))) .cse11 .cse12 .cse13 .cse14 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse15 |~#BOOL_unsigned_char_Array_0~0.offset|))) (_ bv1 32)) (= ((_ extract 7 0) .cse16) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (= .cse16 .cse17))) (and (exists ((v_arrayElimCell_58 (_ BitVec 32))) (let ((.cse18 ((_ extract 7 0) v_arrayElimCell_58))) (let ((.cse19 ((_ zero_extend 24) .cse18))) (and (= ((_ extract 7 0) ((_ sign_extend 24) .cse18)) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (bvsge .cse19 (_ bv1 32)) (bvsle .cse19 (_ bv1 32)))))) .cse0 .cse8 .cse1 .cse11 .cse9 (not (= ((_ extract 7 0) .cse17) (_ bv0 8))) .cse12 .cse4 (= ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) .cse20)))) (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)) .cse13 .cse14 .cse5 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) .cse10))))) .cse6)))) [2023-12-24 14:44:53,670 INFO L899 garLoopResultBuilder]: For program point L80-9(line 80) no Hoare annotation was computed. [2023-12-24 14:44:53,670 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L82-2(line 82) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L82-3(line 82) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L82-5(line 82) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L82-7(line 82) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L895 garLoopResultBuilder]: At program point L82-8(line 82) the Hoare annotation is: (let ((.cse15 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse22 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse23 ((_ 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_0Var0_Pointer~0.offset)))) (.cse21 ((_ sign_extend 16) (_ bv32 16))) (.cse20 (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (let ((.cse0 (= .cse21 .cse20)) (.cse8 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset))) (_ bv1 32))) (.cse1 (bvsge .cse23 (_ bv1 32))) (.cse11 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset .cse22)) (.cse9 (bvsle .cse23 (_ bv1 32))) (.cse17 (select .cse15 .cse22)) (.cse12 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse4 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base |~#signed_short_int_Array_0~0.base|)) (.cse13 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.offset| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)) (.cse5 (= |~#signed_short_int_Array_0~0.offset| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)) (.cse10 ((_ extract 15 0) .cse21)) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse16 ((_ sign_extend 24) (_ bv0 8)))) (and (let ((.cse3 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|))) (or (let ((.cse2 ((_ sign_extend 16) (_ bv256 16)))) (and .cse0 .cse1 (= .cse2 .cse3) .cse4 .cse5 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse2)) .cse6)) (let ((.cse7 ((_ sign_extend 16) .cse10))) (and .cse0 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse7)) .cse8 .cse1 .cse9 .cse4 .cse5 (= .cse7 .cse3) .cse6)))) .cse11 .cse12 .cse13 .cse14 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse15 |~#BOOL_unsigned_char_Array_0~0.offset|))) (_ bv1 32)) (= ((_ extract 7 0) .cse16) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (= .cse16 .cse17))) (and (exists ((v_arrayElimCell_58 (_ BitVec 32))) (let ((.cse18 ((_ extract 7 0) v_arrayElimCell_58))) (let ((.cse19 ((_ zero_extend 24) .cse18))) (and (= ((_ extract 7 0) ((_ sign_extend 24) .cse18)) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (bvsge .cse19 (_ bv1 32)) (bvsle .cse19 (_ bv1 32)))))) .cse0 .cse8 .cse1 .cse11 .cse9 (not (= ((_ extract 7 0) .cse17) (_ bv0 8))) .cse12 .cse4 (= ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) .cse20)))) (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)) .cse13 .cse14 .cse5 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) .cse10))))) .cse6)))) [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L82-9(line 82) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 74) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L67-2(line 67) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L67-3(lines 67 73) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 59) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L84-2(line 84) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 51 59) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L84-3(line 84) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L84-5(line 84) no Hoare annotation was computed. [2023-12-24 14:44:53,671 INFO L899 garLoopResultBuilder]: For program point L84-7(line 84) no Hoare annotation was computed. [2023-12-24 14:44:53,672 INFO L895 garLoopResultBuilder]: At program point L84-8(line 84) the Hoare annotation is: (let ((.cse15 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse22 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse23 ((_ 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_0Var0_Pointer~0.offset)))) (.cse21 ((_ sign_extend 16) (_ bv32 16))) (.cse20 (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (let ((.cse0 (= .cse21 .cse20)) (.cse8 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset))) (_ bv1 32))) (.cse1 (bvsge .cse23 (_ bv1 32))) (.cse11 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset .cse22)) (.cse9 (bvsle .cse23 (_ bv1 32))) (.cse17 (select .cse15 .cse22)) (.cse12 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse4 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base |~#signed_short_int_Array_0~0.base|)) (.cse13 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse14 (= |~#BOOL_unsigned_char_Array_0~0.offset| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)) (.cse5 (= |~#signed_short_int_Array_0~0.offset| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)) (.cse10 ((_ extract 15 0) .cse21)) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse16 ((_ sign_extend 24) (_ bv0 8)))) (and (let ((.cse3 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|))) (or (let ((.cse2 ((_ sign_extend 16) (_ bv256 16)))) (and .cse0 .cse1 (= .cse2 .cse3) .cse4 .cse5 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse2)) .cse6)) (let ((.cse7 ((_ sign_extend 16) .cse10))) (and .cse0 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse7)) .cse8 .cse1 .cse9 .cse4 .cse5 (= .cse7 .cse3) .cse6)))) .cse11 .cse12 .cse13 .cse14 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse15 |~#BOOL_unsigned_char_Array_0~0.offset|))) (_ bv1 32)) (= ((_ extract 7 0) .cse16) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (= .cse16 .cse17))) (and (exists ((v_arrayElimCell_58 (_ BitVec 32))) (let ((.cse18 ((_ extract 7 0) v_arrayElimCell_58))) (let ((.cse19 ((_ zero_extend 24) .cse18))) (and (= ((_ extract 7 0) ((_ sign_extend 24) .cse18)) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (bvsge .cse19 (_ bv1 32)) (bvsle .cse19 (_ bv1 32)))))) .cse0 .cse8 .cse1 .cse11 .cse9 (not (= ((_ extract 7 0) .cse17) (_ bv0 8))) .cse12 .cse4 (= ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) .cse20)))) (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)) .cse13 .cse14 .cse5 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) .cse10))))) .cse6)))) [2023-12-24 14:44:53,672 INFO L899 garLoopResultBuilder]: For program point L84-9(line 84) no Hoare annotation was computed. [2023-12-24 14:44:53,672 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-24 14:44:53,672 INFO L895 garLoopResultBuilder]: At program point L101-2(lines 101 107) the Hoare annotation is: (let ((.cse30 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse29 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse24 ((_ extract 7 0) (select .cse30 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (let ((.cse26 ((_ zero_extend 24) .cse24)) (.cse28 (select (select |#memory_int#5| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset)) (.cse12 ((_ sign_extend 24) (_ bv0 8))) (.cse25 (select .cse30 .cse29))) (let ((.cse15 (= .cse12 .cse25)) (.cse0 (= ((_ sign_extend 16) (_ bv32 16)) .cse28)) (.cse1 (bvsge .cse26 (_ bv1 32))) (.cse2 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.offset .cse29)) (.cse4 (= |~#BOOL_unsigned_char_Array_0~0.base| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base)) (.cse5 (= ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base |~#signed_short_int_Array_0~0.base|)) (.cse22 (= ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) .cse28)))) (select (select |#memory_int#4| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))) (.cse6 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse9 (= |~#BOOL_unsigned_char_Array_0~0.offset| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset)) (.cse10 (= |~#signed_short_int_Array_0~0.offset| ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset)) (.cse23 (let ((.cse27 ((_ sign_extend 16) ~last_1_signed_short_int_Array_0_0_~0))) (bvslt (bvmul (_ bv2 32) .cse27) (bvmul .cse27 .cse27)))) (.cse11 (bvsle .cse26 (_ bv1 32))) (.cse14 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse3 ((_ sign_extend 16) (_ bv256 16))) (.cse7 (let ((.cse20 (let ((.cse21 (select |#memory_int#2| ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.base))) (concat (select .cse21 (bvadd (_ bv4 32) ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset)) (select .cse21 ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse20) ((_ extract 62 52) .cse20) ((_ extract 51 0) .cse20)))) (.cse8 (let ((.cse18 (let ((.cse19 (select |#memory_int#2| ~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.base))) (concat (select .cse19 (bvadd (_ bv4 32) ~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset)) (select .cse19 ~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse18) ((_ extract 62 52) .cse18) ((_ extract 51 0) .cse18)))) (.cse13 (let ((.cse16 (let ((.cse17 (select |#memory_int#2| ~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.base))) (concat (select .cse17 (bvadd (_ bv4 32) ~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.offset)) (select .cse17 ~double_Array_0_arraydouble_Array_0arrayVar2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse16) ((_ extract 62 52) .cse16) ((_ extract 51 0) .cse16))))) (and .cse0 .cse1 .cse2 (= .cse3 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) .cse4 .cse5 .cse6 (not (fp.lt .cse7 .cse8)) .cse9 .cse10 .cse11 (= ((_ extract 7 0) .cse12) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse3)) (fp.leq .cse7 .cse13) (exists ((|ULTIMATE.start_step_#t~mem17#1| (_ FloatingPoint 11 53))) (fp.lt .cse7 |ULTIMATE.start_step_#t~mem17#1|)) .cse14 (fp.leq .cse8 .cse13) .cse15)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse22 .cse6 .cse9 .cse10 .cse23 .cse11 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse22 .cse6 .cse9 .cse10 .cse23 .cse11 (= ((_ sign_extend 24) .cse24) .cse25) .cse14)))))) [2023-12-24 14:44:53,672 INFO L899 garLoopResultBuilder]: For program point L68-2(lines 68 70) no Hoare annotation was computed. [2023-12-24 14:44:53,672 INFO L899 garLoopResultBuilder]: For program point L101-3(lines 101 107) no Hoare annotation was computed. [2023-12-24 14:44:53,674 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 14:44:53,675 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 14:44:53,685 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!base][~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,686 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 14:44:53,686 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated [2023-12-24 14:44:53,687 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] could not be translated [2023-12-24 14:44:53,687 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,687 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] could not be translated [2023-12-24 14:44:53,687 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,687 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] could not be translated [2023-12-24 14:44:53,687 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,688 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]],51,0]]] [2023-12-24 14:44:53,688 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 14:44:53,688 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] could not be translated [2023-12-24 14:44:53,688 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,688 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] could not be translated [2023-12-24 14:44:53,688 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,688 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] could not be translated [2023-12-24 14:44:53,688 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,689 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]],51,0]]] [2023-12-24 14:44:53,689 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_step_#t~mem17#1 : C_DOUBLE :: ~fp.lt~64(~fp~64((#memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] ++ #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset])[63:63], (#memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] ++ #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset])[62:52], (#memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] ++ #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset])[51:0]), ULTIMATE.start_step_#t~mem17#1)) could not be translated [2023-12-24 14:44:53,689 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 14:44:53,689 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset)] could not be translated [2023-12-24 14:44:53,689 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,689 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset)] could not be translated [2023-12-24 14:44:53,689 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,689 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset)] could not be translated [2023-12-24 14:44:53,689 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,689 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset,GLOBAL]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset,GLOBAL]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset,GLOBAL]]]],51,0]]] [2023-12-24 14:44:53,689 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 14:44:53,689 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!base][~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,689 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 14:44:53,690 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!base][~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,690 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,690 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 14:44:53,690 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 14:44:53,690 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 14:44:53,690 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!base][~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,690 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 14:44:53,690 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!base][~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,690 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-24 14:44:53,691 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 14:44:53,691 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 14:44:53,691 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 14:44:53,691 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 14:44:53,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 02:44:53 BoogieIcfgContainer [2023-12-24 14:44:53,691 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 14:44:53,691 INFO L158 Benchmark]: Toolchain (without parser) took 580373.56ms. Allocated memory was 199.2MB in the beginning and 791.7MB in the end (delta: 592.4MB). Free memory was 134.8MB in the beginning and 548.6MB in the end (delta: -413.8MB). Peak memory consumption was 454.2MB. Max. memory is 8.0GB. [2023-12-24 14:44:53,692 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 199.2MB. Free memory is still 148.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 14:44:53,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.88ms. Allocated memory is still 199.2MB. Free memory was 134.6MB in the beginning and 119.3MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-24 14:44:53,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.25ms. Allocated memory is still 199.2MB. Free memory was 119.3MB in the beginning and 116.0MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 14:44:53,692 INFO L158 Benchmark]: Boogie Preprocessor took 99.88ms. Allocated memory was 199.2MB in the beginning and 263.2MB in the end (delta: 64.0MB). Free memory was 116.0MB in the beginning and 224.4MB in the end (delta: -108.4MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2023-12-24 14:44:53,692 INFO L158 Benchmark]: RCFGBuilder took 8254.52ms. Allocated memory is still 263.2MB. Free memory was 224.4MB in the beginning and 182.4MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2023-12-24 14:44:53,692 INFO L158 Benchmark]: TraceAbstraction took 571729.71ms. Allocated memory was 263.2MB in the beginning and 791.7MB in the end (delta: 528.5MB). Free memory was 181.4MB in the beginning and 548.6MB in the end (delta: -367.2MB). Peak memory consumption was 436.0MB. Max. memory is 8.0GB. [2023-12-24 14:44:53,692 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 199.2MB. Free memory is still 148.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.88ms. Allocated memory is still 199.2MB. Free memory was 134.6MB in the beginning and 119.3MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.25ms. Allocated memory is still 199.2MB. Free memory was 119.3MB in the beginning and 116.0MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 99.88ms. Allocated memory was 199.2MB in the beginning and 263.2MB in the end (delta: 64.0MB). Free memory was 116.0MB in the beginning and 224.4MB in the end (delta: -108.4MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * RCFGBuilder took 8254.52ms. Allocated memory is still 263.2MB. Free memory was 224.4MB in the beginning and 182.4MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 571729.71ms. Allocated memory was 263.2MB in the beginning and 791.7MB in the end (delta: 528.5MB). Free memory was 181.4MB in the beginning and 548.6MB in the end (delta: -367.2MB). Peak memory consumption was 436.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!base][~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset,GLOBAL]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_step_#t~mem17#1 : C_DOUBLE :: ~fp.lt~64(~fp~64((#memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] ++ #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset])[63:63], (#memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] ++ #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset])[62:52], (#memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset)] ++ #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar1_Pointer~0!offset])[51:0]), ULTIMATE.start_step_#t~mem17#1)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base][~bvadd~32(4bv32, ~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base][~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset,GLOBAL]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset,GLOBAL]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[BitvecLiteral[4,32],IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset,GLOBAL]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~double_Array_0_arraydouble_Array_0arrayVar0_Pointer~0!offset,GLOBAL]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!base][~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!base][~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!base][~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!base][~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!base][~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven 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, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 571.7s, OverallIterations: 28, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 356.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 151.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 5879 SdHoareTripleChecker+Valid, 343.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5874 mSDsluCounter, 20649 SdHoareTripleChecker+Invalid, 337.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16616 mSDsCounter, 360 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4436 IncrementalHoareTripleChecker+Invalid, 4807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 360 mSolverCounterUnsat, 4033 mSDtfsCounter, 4436 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4353 GetRequests, 3994 SyntacticMatches, 2 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 19.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1790occurred in iteration=22, InterpolantAutomatonStates: 291, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 2617 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 368 PreInvPairs, 394 NumberOfFragments, 2932 HoareAnnotationTreeSize, 368 FormulaSimplifications, 52057953 FormulaSimplificationTreeSizeReduction, 88.4s HoareSimplificationTime, 9 FormulaSimplificationsInter, 413092 FormulaSimplificationTreeSizeReductionInter, 63.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 11.7s SatisfiabilityAnalysisTime, 41.8s InterpolantComputationTime, 3157 NumberOfCodeBlocks, 3157 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4175 ConstructedInterpolants, 105 QuantifiedInterpolants, 40093 SizeOfPredicates, 249 NumberOfNonLiveVariables, 8329 ConjunctsInSsa, 270 ConjunctsInUnsatCore, 35 InterpolantComputations, 22 PerfectInterpolantSequences, 6082/7815 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: 101]: Loop Invariant Derived loop invariant: (((((((null & 127) >= 1) && ((null & 127) <= 1)) && ((0 & 127) == last_1_BOOL_unsigned_char_Array_0_1_)) && (last_1_signed_short_int_Array_0_0_ == (256 & 32767))) || ((((null & 127) >= 1) && ((2 * last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_))) && ((null & 127) <= 1))) || ((((null & 127) >= 1) && ((2 * last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_))) && ((null & 127) <= 1))) RESULT: Ultimate proved your program to be correct! [2023-12-24 14:44:53,903 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 14:44:53,945 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 137 Received shutdown request...