/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-a_file-53.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 13:33:58,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 13:33:58,294 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 13:33:58,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 13:33:58,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 13:33:58,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 13:33:58,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 13:33:58,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 13:33:58,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 13:33:58,327 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 13:33:58,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 13:33:58,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 13:33:58,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 13:33:58,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 13:33:58,329 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 13:33:58,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 13:33:58,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 13:33:58,329 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 13:33:58,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 13:33:58,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 13:33:58,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 13:33:58,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 13:33:58,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 13:33:58,331 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 13:33:58,331 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 13:33:58,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 13:33:58,331 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 13:33:58,332 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 13:33:58,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 13:33:58,332 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 13:33:58,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 13:33:58,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 13:33:58,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 13:33:58,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 13:33:58,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 13:33:58,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 13:33:58,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 13:33:58,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 13:33:58,334 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 13:33:58,334 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 13:33:58,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 13:33:58,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 13:33:58,334 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 13:33:58,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 13:33:58,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 13:33:58,334 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 13:33:58,335 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 13:33:58,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 13:33:58,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 13:33:58,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 13:33:58,505 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 13:33:58,506 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 13:33:58,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i [2023-12-24 13:33:59,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 13:33:59,679 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 13:33:59,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i [2023-12-24 13:33:59,686 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef2955088/f2ad78f005994475bb966b5bab139234/FLAGbd65dcf00 [2023-12-24 13:33:59,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef2955088/f2ad78f005994475bb966b5bab139234 [2023-12-24 13:33:59,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 13:33:59,698 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 13:33:59,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 13:33:59,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 13:33:59,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 13:33:59,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:33:59" (1/1) ... [2023-12-24 13:33:59,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e60d1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:33:59, skipping insertion in model container [2023-12-24 13:33:59,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:33:59" (1/1) ... [2023-12-24 13:33:59,733 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 13:33:59,849 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-a_file-53.i[916,929] [2023-12-24 13:33:59,910 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 13:33:59,920 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 13:33:59,928 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-a_file-53.i[916,929] [2023-12-24 13:33:59,960 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 13:33:59,980 INFO L206 MainTranslator]: Completed translation [2023-12-24 13:33:59,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:33:59 WrapperNode [2023-12-24 13:33:59,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 13:33:59,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 13:33:59,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 13:33:59,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 13:33:59,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:33:59" (1/1) ... [2023-12-24 13:34:00,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:33:59" (1/1) ... [2023-12-24 13:34:00,031 INFO L138 Inliner]: procedures = 36, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 491 [2023-12-24 13:34:00,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 13:34:00,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 13:34:00,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 13:34:00,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 13:34:00,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:33:59" (1/1) ... [2023-12-24 13:34:00,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:33:59" (1/1) ... [2023-12-24 13:34:00,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:33:59" (1/1) ... [2023-12-24 13:34:00,060 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 45, 20, 39, 27]. 34 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 2, 5, 2]. The 18 writes are split as follows [0, 9, 2, 5, 2]. [2023-12-24 13:34:00,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:33:59" (1/1) ... [2023-12-24 13:34:00,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:33:59" (1/1) ... [2023-12-24 13:34:00,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:33:59" (1/1) ... [2023-12-24 13:34:00,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:33:59" (1/1) ... [2023-12-24 13:34:00,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:33:59" (1/1) ... [2023-12-24 13:34:00,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:33:59" (1/1) ... [2023-12-24 13:34:00,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 13:34:00,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 13:34:00,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 13:34:00,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 13:34:00,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:33:59" (1/1) ... [2023-12-24 13:34:00,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 13:34:00,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 13:34:00,145 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 13:34:00,166 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 13:34:00,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 13:34:00,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-12-24 13:34:00,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-12-24 13:34:00,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-12-24 13:34:00,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2023-12-24 13:34:00,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2023-12-24 13:34:00,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-12-24 13:34:00,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-12-24 13:34:00,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-12-24 13:34:00,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2023-12-24 13:34:00,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2023-12-24 13:34:00,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 13:34:00,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 13:34:00,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 13:34:00,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 13:34:00,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 13:34:00,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 13:34:00,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 13:34:00,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-24 13:34:00,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-24 13:34:00,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-24 13:34:00,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 13:34:00,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 13:34:00,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 13:34:00,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 13:34:00,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 13:34:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 13:34:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 13:34:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-24 13:34:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-24 13:34:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-24 13:34:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-12-24 13:34:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-12-24 13:34:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2023-12-24 13:34:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2023-12-24 13:34:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2023-12-24 13:34:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 13:34:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 13:34:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 13:34:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-24 13:34:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-24 13:34:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 13:34:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 13:34:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-24 13:34:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-24 13:34:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-24 13:34:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 13:34:00,179 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 13:34:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 13:34:00,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 13:34:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 13:34:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 13:34:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 13:34:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 13:34:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 13:34:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 13:34:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 13:34:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-24 13:34:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-24 13:34:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-24 13:34:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 13:34:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 13:34:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 13:34:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-24 13:34:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-24 13:34:00,298 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 13:34:00,300 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 13:34:01,109 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 13:34:01,142 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 13:34:01,143 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 13:34:01,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:34:01 BoogieIcfgContainer [2023-12-24 13:34:01,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 13:34:01,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 13:34:01,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 13:34:01,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 13:34:01,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 01:33:59" (1/3) ... [2023-12-24 13:34:01,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c16ba7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:34:01, skipping insertion in model container [2023-12-24 13:34:01,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:33:59" (2/3) ... [2023-12-24 13:34:01,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c16ba7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:34:01, skipping insertion in model container [2023-12-24 13:34:01,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:34:01" (3/3) ... [2023-12-24 13:34:01,148 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-53.i [2023-12-24 13:34:01,159 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 13:34:01,159 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 13:34:01,187 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 13:34:01,192 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;@450848ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 13:34:01,192 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 13:34:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-24 13:34:01,203 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:01,204 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:01,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:01,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:01,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1983161675, now seen corresponding path program 1 times [2023-12-24 13:34:01,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:01,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988484516] [2023-12-24 13:34:01,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:01,218 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 13:34:01,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:01,220 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 13:34:01,236 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 13:34:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:01,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 13:34:01,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2023-12-24 13:34:01,583 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:34:01,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:01,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988484516] [2023-12-24 13:34:01,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988484516] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:34:01,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:34:01,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 13:34:01,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334944698] [2023-12-24 13:34:01,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:34:01,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 13:34:01,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:01,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 13:34:01,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 13:34:01,606 INFO L87 Difference]: Start difference. First operand has 105 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-24 13:34:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:01,639 INFO L93 Difference]: Finished difference Result 207 states and 330 transitions. [2023-12-24 13:34:01,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 13:34:01,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 135 [2023-12-24 13:34:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:01,646 INFO L225 Difference]: With dead ends: 207 [2023-12-24 13:34:01,646 INFO L226 Difference]: Without dead ends: 103 [2023-12-24 13:34:01,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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 13:34:01,650 INFO L413 NwaCegarLoop]: 146 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, 146 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 13:34:01,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:34:01,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-24 13:34:01,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-24 13:34:01,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2023-12-24 13:34:01,680 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 135 [2023-12-24 13:34:01,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:01,680 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2023-12-24 13:34:01,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-24 13:34:01,681 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2023-12-24 13:34:01,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-24 13:34:01,683 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:01,683 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:01,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 13:34:01,891 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 13:34:01,892 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:01,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:01,892 INFO L85 PathProgramCache]: Analyzing trace with hash 833082901, now seen corresponding path program 1 times [2023-12-24 13:34:01,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:01,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470758260] [2023-12-24 13:34:01,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:01,893 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 13:34:01,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:01,895 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 13:34:01,927 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 13:34:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:02,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:34:02,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:02,254 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 13:34:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:34:02,294 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:34:02,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:02,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470758260] [2023-12-24 13:34:02,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470758260] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:34:02,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:34:02,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 13:34:02,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117254347] [2023-12-24 13:34:02,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:34:02,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 13:34:02,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:02,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 13:34:02,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:34:02,297 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:02,352 INFO L93 Difference]: Finished difference Result 205 states and 299 transitions. [2023-12-24 13:34:02,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 13:34:02,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2023-12-24 13:34:02,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:02,357 INFO L225 Difference]: With dead ends: 205 [2023-12-24 13:34:02,357 INFO L226 Difference]: Without dead ends: 103 [2023-12-24 13:34:02,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:34:02,359 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:02,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 285 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:34:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-24 13:34:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-24 13:34:02,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2023-12-24 13:34:02,367 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 135 [2023-12-24 13:34:02,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:02,372 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2023-12-24 13:34:02,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2023-12-24 13:34:02,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-24 13:34:02,378 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:02,379 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:02,387 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 13:34:02,586 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 13:34:02,589 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:02,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:02,591 INFO L85 PathProgramCache]: Analyzing trace with hash -446780777, now seen corresponding path program 1 times [2023-12-24 13:34:02,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:02,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061657543] [2023-12-24 13:34:02,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:02,592 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 13:34:02,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:02,593 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 13:34:02,600 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 13:34:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:02,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 13:34:02,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:02,940 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 8 treesize of output 1 [2023-12-24 13:34:03,070 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 16 [2023-12-24 13:34:03,209 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 16 [2023-12-24 13:34:03,321 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 10 [2023-12-24 13:34:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 24 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2023-12-24 13:34:03,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:34:03,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:03,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061657543] [2023-12-24 13:34:03,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061657543] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:34:03,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1263420474] [2023-12-24 13:34:03,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:03,508 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 13:34:03,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 13:34:03,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 13:34:03,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-24 13:34:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:04,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 13:34:04,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:04,357 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 13:34:04,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-24 13:34:04,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-24 13:34:04,851 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 10 [2023-12-24 13:34:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 24 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2023-12-24 13:34:04,876 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:34:04,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1263420474] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:34:04,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:34:04,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-12-24 13:34:04,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930385027] [2023-12-24 13:34:04,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:34:04,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 13:34:04,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:04,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 13:34:04,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2023-12-24 13:34:04,980 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 24 states, 20 states have (on average 5.1) internal successors, (102), 22 states have internal predecessors, (102), 8 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) [2023-12-24 13:34:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:05,746 INFO L93 Difference]: Finished difference Result 216 states and 307 transitions. [2023-12-24 13:34:05,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 13:34:05,747 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 5.1) internal successors, (102), 22 states have internal predecessors, (102), 8 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) Word has length 135 [2023-12-24 13:34:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:05,748 INFO L225 Difference]: With dead ends: 216 [2023-12-24 13:34:05,748 INFO L226 Difference]: Without dead ends: 114 [2023-12-24 13:34:05,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2023-12-24 13:34:05,750 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 205 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:05,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 894 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 13:34:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-24 13:34:05,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2023-12-24 13:34:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2023-12-24 13:34:05,774 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 135 [2023-12-24 13:34:05,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:05,775 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2023-12-24 13:34:05,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 5.1) internal successors, (102), 22 states have internal predecessors, (102), 8 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) [2023-12-24 13:34:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2023-12-24 13:34:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-24 13:34:05,776 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:05,777 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:05,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 13:34:05,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-12-24 13:34:06,184 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 13:34:06,185 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:06,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:06,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1033586791, now seen corresponding path program 1 times [2023-12-24 13:34:06,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:06,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598895221] [2023-12-24 13:34:06,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:06,186 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 13:34:06,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:06,188 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 13:34:06,221 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 13:34:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:06,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 13:34:06,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:06,474 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 8 treesize of output 1 [2023-12-24 13:34:06,742 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 16 [2023-12-24 13:34:06,824 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 10 [2023-12-24 13:34:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 218 proven. 12 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2023-12-24 13:34:06,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:34:07,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:07,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598895221] [2023-12-24 13:34:07,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598895221] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:34:07,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [987314525] [2023-12-24 13:34:07,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:07,048 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 13:34:07,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 13:34:07,049 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 13:34:07,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-24 13:34:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:07,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 13:34:07,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:07,901 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 13:34:08,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-24 13:34:08,342 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 10 [2023-12-24 13:34:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 218 proven. 12 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2023-12-24 13:34:08,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:34:08,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [987314525] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:34:08,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:34:08,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-12-24 13:34:08,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978553523] [2023-12-24 13:34:08,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:34:08,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 13:34:08,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:08,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 13:34:08,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2023-12-24 13:34:08,448 INFO L87 Difference]: Start difference. First operand 112 states and 156 transitions. Second operand has 24 states, 20 states have (on average 5.1) internal successors, (102), 22 states have internal predecessors, (102), 8 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) [2023-12-24 13:34:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:09,322 INFO L93 Difference]: Finished difference Result 233 states and 319 transitions. [2023-12-24 13:34:09,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 13:34:09,323 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 5.1) internal successors, (102), 22 states have internal predecessors, (102), 8 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) Word has length 135 [2023-12-24 13:34:09,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:09,324 INFO L225 Difference]: With dead ends: 233 [2023-12-24 13:34:09,324 INFO L226 Difference]: Without dead ends: 122 [2023-12-24 13:34:09,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2023-12-24 13:34:09,327 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 410 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:09,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1161 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 13:34:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-24 13:34:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2023-12-24 13:34:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 160 transitions. [2023-12-24 13:34:09,336 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 160 transitions. Word has length 135 [2023-12-24 13:34:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:09,337 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 160 transitions. [2023-12-24 13:34:09,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 5.1) internal successors, (102), 22 states have internal predecessors, (102), 8 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) [2023-12-24 13:34:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 160 transitions. [2023-12-24 13:34:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-24 13:34:09,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:09,338 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:09,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-12-24 13:34:09,554 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 13:34:09,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 13:34:09,754 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:09,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:09,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1959110827, now seen corresponding path program 1 times [2023-12-24 13:34:09,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:09,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399896397] [2023-12-24 13:34:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:09,756 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 13:34:09,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:09,757 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 13:34:09,789 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 13:34:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:10,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 13:34:10,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:10,053 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 8 treesize of output 1 [2023-12-24 13:34:10,086 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 26 treesize of output 25 [2023-12-24 13:34:10,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:34:10,183 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 1 case distinctions, treesize of input 41 treesize of output 28 [2023-12-24 13:34:10,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:34:10,605 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 1 case distinctions, treesize of input 43 treesize of output 39 [2023-12-24 13:34:10,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:34:10,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 42 [2023-12-24 13:34:10,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:34:10,720 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 84 treesize of output 36 [2023-12-24 13:34:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 83 proven. 48 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2023-12-24 13:34:10,744 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:34:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:34:10,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:10,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399896397] [2023-12-24 13:34:10,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399896397] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:34:10,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:34:10,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-24 13:34:10,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478950907] [2023-12-24 13:34:10,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:34:10,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:34:10,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:10,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:34:10,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:34:10,832 INFO L87 Difference]: Start difference. First operand 119 states and 160 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:11,529 INFO L93 Difference]: Finished difference Result 265 states and 360 transitions. [2023-12-24 13:34:11,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:34:11,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2023-12-24 13:34:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:11,530 INFO L225 Difference]: With dead ends: 265 [2023-12-24 13:34:11,530 INFO L226 Difference]: Without dead ends: 147 [2023-12-24 13:34:11,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-12-24 13:34:11,531 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 160 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:11,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 447 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 13:34:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-24 13:34:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 121. [2023-12-24 13:34:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 162 transitions. [2023-12-24 13:34:11,538 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 162 transitions. Word has length 136 [2023-12-24 13:34:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:11,538 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 162 transitions. [2023-12-24 13:34:11,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 162 transitions. [2023-12-24 13:34:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-24 13:34:11,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:11,539 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:11,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 13:34:11,747 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 13:34:11,748 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:11,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1566083817, now seen corresponding path program 1 times [2023-12-24 13:34:11,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:11,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831240648] [2023-12-24 13:34:11,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:11,749 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 13:34:11,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:11,750 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 13:34:11,768 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 13:34:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:12,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-24 13:34:12,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:12,042 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 8 treesize of output 1 [2023-12-24 13:34:12,076 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 27 treesize of output 11 [2023-12-24 13:34:12,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-12-24 13:34:12,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:34:12,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 54 treesize of output 38 [2023-12-24 13:34:12,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:34:12,697 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 60 treesize of output 22 [2023-12-24 13:34:12,733 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 408 proven. 54 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-24 13:34:12,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:34:13,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:13,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831240648] [2023-12-24 13:34:13,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831240648] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:34:13,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1966207218] [2023-12-24 13:34:13,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:13,498 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 13:34:13,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 13:34:13,499 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 13:34:13,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-24 13:34:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:14,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-24 13:34:14,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:14,334 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 13:34:14,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-24 13:34:14,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-24 13:34:15,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:34:15,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2023-12-24 13:34:15,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:34:15,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 22 [2023-12-24 13:34:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 408 proven. 54 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-24 13:34:15,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:34:15,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1966207218] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:34:15,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:34:15,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2023-12-24 13:34:15,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467462423] [2023-12-24 13:34:15,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:34:15,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-24 13:34:15,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:15,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-24 13:34:15,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1758, Unknown=0, NotChecked=0, Total=2162 [2023-12-24 13:34:15,870 INFO L87 Difference]: Start difference. First operand 121 states and 162 transitions. Second operand has 36 states, 28 states have (on average 4.071428571428571) internal successors, (114), 32 states have internal predecessors, (114), 14 states have call successors, (36), 10 states have call predecessors, (36), 14 states have return successors, (36), 10 states have call predecessors, (36), 14 states have call successors, (36) [2023-12-24 13:34:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:16,901 INFO L93 Difference]: Finished difference Result 253 states and 333 transitions. [2023-12-24 13:34:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-24 13:34:16,902 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 4.071428571428571) internal successors, (114), 32 states have internal predecessors, (114), 14 states have call successors, (36), 10 states have call predecessors, (36), 14 states have return successors, (36), 10 states have call predecessors, (36), 14 states have call successors, (36) Word has length 136 [2023-12-24 13:34:16,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:16,903 INFO L225 Difference]: With dead ends: 253 [2023-12-24 13:34:16,903 INFO L226 Difference]: Without dead ends: 133 [2023-12-24 13:34:16,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 341 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=684, Invalid=2738, Unknown=0, NotChecked=0, Total=3422 [2023-12-24 13:34:16,904 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 131 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:16,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1190 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 13:34:16,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-24 13:34:16,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2023-12-24 13:34:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 103 states have (on average 1.2718446601941749) internal successors, (131), 103 states have internal predecessors, (131), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 167 transitions. [2023-12-24 13:34:16,911 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 167 transitions. Word has length 136 [2023-12-24 13:34:16,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:16,911 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 167 transitions. [2023-12-24 13:34:16,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 4.071428571428571) internal successors, (114), 32 states have internal predecessors, (114), 14 states have call successors, (36), 10 states have call predecessors, (36), 14 states have return successors, (36), 10 states have call predecessors, (36), 14 states have call successors, (36) [2023-12-24 13:34:16,911 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 167 transitions. [2023-12-24 13:34:16,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-24 13:34:16,912 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:16,912 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:16,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-24 13:34:17,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2023-12-24 13:34:17,330 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 13:34:17,330 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:17,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1996094544, now seen corresponding path program 1 times [2023-12-24 13:34:17,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:17,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880317975] [2023-12-24 13:34:17,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:17,331 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 13:34:17,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:17,332 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 13:34:17,333 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 13:34:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:18,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-24 13:34:18,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:18,041 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 1 [2023-12-24 13:34:18,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2023-12-24 13:34:18,993 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 33 treesize of output 26 [2023-12-24 13:34:19,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:34:19,125 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 1 case distinctions, treesize of input 81 treesize of output 59 [2023-12-24 13:34:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 323 proven. 12 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2023-12-24 13:34:22,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:34:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:34:22,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:22,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880317975] [2023-12-24 13:34:22,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880317975] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:34:22,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:34:22,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [26] total 27 [2023-12-24 13:34:22,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302092432] [2023-12-24 13:34:22,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:34:22,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:34:22,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:22,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:34:22,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2023-12-24 13:34:22,973 INFO L87 Difference]: Start difference. First operand 129 states and 167 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:24,066 INFO L93 Difference]: Finished difference Result 302 states and 392 transitions. [2023-12-24 13:34:24,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 13:34:24,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2023-12-24 13:34:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:24,068 INFO L225 Difference]: With dead ends: 302 [2023-12-24 13:34:24,068 INFO L226 Difference]: Without dead ends: 174 [2023-12-24 13:34:24,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2023-12-24 13:34:24,069 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 108 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:24,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 415 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-24 13:34:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-24 13:34:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2023-12-24 13:34:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 123 states have internal predecessors, (154), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-24 13:34:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 206 transitions. [2023-12-24 13:34:24,083 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 206 transitions. Word has length 138 [2023-12-24 13:34:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:24,084 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 206 transitions. [2023-12-24 13:34:24,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 206 transitions. [2023-12-24 13:34:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-24 13:34:24,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:24,085 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:24,093 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 13:34:24,293 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 13:34:24,293 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:24,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:24,293 INFO L85 PathProgramCache]: Analyzing trace with hash 290937586, now seen corresponding path program 1 times [2023-12-24 13:34:24,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:24,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370090085] [2023-12-24 13:34:24,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:24,294 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 13:34:24,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:24,296 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 13:34:24,296 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 13:34:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:24,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 13:34:24,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:24,629 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 13:34:24,659 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 10 [2023-12-24 13:34:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:34:24,678 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:34:24,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:24,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370090085] [2023-12-24 13:34:24,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370090085] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:34:24,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:34:24,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 13:34:24,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717913517] [2023-12-24 13:34:24,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:34:24,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 13:34:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:24,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 13:34:24,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:34:24,680 INFO L87 Difference]: Start difference. First operand 157 states and 206 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:25,117 INFO L93 Difference]: Finished difference Result 393 states and 513 transitions. [2023-12-24 13:34:25,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 13:34:25,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2023-12-24 13:34:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:25,120 INFO L225 Difference]: With dead ends: 393 [2023-12-24 13:34:25,120 INFO L226 Difference]: Without dead ends: 263 [2023-12-24 13:34:25,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:34:25,121 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 191 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:25,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 664 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 13:34:25,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-12-24 13:34:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 145. [2023-12-24 13:34:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 118 states have (on average 1.271186440677966) internal successors, (150), 118 states have internal predecessors, (150), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 186 transitions. [2023-12-24 13:34:25,131 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 186 transitions. Word has length 143 [2023-12-24 13:34:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:25,131 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 186 transitions. [2023-12-24 13:34:25,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 186 transitions. [2023-12-24 13:34:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-24 13:34:25,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:25,133 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:25,140 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 13:34:25,340 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 13:34:25,340 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:25,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:25,341 INFO L85 PathProgramCache]: Analyzing trace with hash -102089424, now seen corresponding path program 1 times [2023-12-24 13:34:25,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:25,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751580292] [2023-12-24 13:34:25,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:25,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 13:34:25,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:25,342 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 13:34:25,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-24 13:34:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:25,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:34:25,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:25,643 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 13:34:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:34:25,652 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:34:25,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:25,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751580292] [2023-12-24 13:34:25,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751580292] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:34:25,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:34:25,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 13:34:25,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110209242] [2023-12-24 13:34:25,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:34:25,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 13:34:25,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:25,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 13:34:25,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:34:25,653 INFO L87 Difference]: Start difference. First operand 145 states and 186 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:25,682 INFO L93 Difference]: Finished difference Result 289 states and 371 transitions. [2023-12-24 13:34:25,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 13:34:25,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2023-12-24 13:34:25,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:25,687 INFO L225 Difference]: With dead ends: 289 [2023-12-24 13:34:25,687 INFO L226 Difference]: Without dead ends: 145 [2023-12-24 13:34:25,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:34:25,689 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 36 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:25,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 241 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:34:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-24 13:34:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2023-12-24 13:34:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 118 states have (on average 1.2542372881355932) internal successors, (148), 118 states have internal predecessors, (148), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 184 transitions. [2023-12-24 13:34:25,699 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 184 transitions. Word has length 143 [2023-12-24 13:34:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:25,699 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 184 transitions. [2023-12-24 13:34:25,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 184 transitions. [2023-12-24 13:34:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-24 13:34:25,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:25,700 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:25,715 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 13:34:25,908 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 13:34:25,908 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:25,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:25,909 INFO L85 PathProgramCache]: Analyzing trace with hash 156076014, now seen corresponding path program 1 times [2023-12-24 13:34:25,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:25,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341909463] [2023-12-24 13:34:25,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:25,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:34:25,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:25,911 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 13:34:25,912 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 13:34:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:26,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 13:34:26,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:34:26,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:34:26,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:26,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341909463] [2023-12-24 13:34:26,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341909463] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:34:26,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:34:26,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 13:34:26,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971865115] [2023-12-24 13:34:26,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:34:26,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:34:26,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:26,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:34:26,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:34:26,298 INFO L87 Difference]: Start difference. First operand 145 states and 184 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:26,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:26,636 INFO L93 Difference]: Finished difference Result 362 states and 464 transitions. [2023-12-24 13:34:26,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:34:26,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2023-12-24 13:34:26,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:26,638 INFO L225 Difference]: With dead ends: 362 [2023-12-24 13:34:26,638 INFO L226 Difference]: Without dead ends: 218 [2023-12-24 13:34:26,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:34:26,639 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 100 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:26,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 530 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:34:26,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-12-24 13:34:26,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 145. [2023-12-24 13:34:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 118 states have (on average 1.2457627118644068) internal successors, (147), 118 states have internal predecessors, (147), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 183 transitions. [2023-12-24 13:34:26,647 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 183 transitions. Word has length 143 [2023-12-24 13:34:26,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:26,647 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 183 transitions. [2023-12-24 13:34:26,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:26,647 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 183 transitions. [2023-12-24 13:34:26,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-24 13:34:26,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:26,648 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:26,663 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 13:34:26,856 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 13:34:26,856 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:26,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:26,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1139840718, now seen corresponding path program 1 times [2023-12-24 13:34:26,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:26,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980440368] [2023-12-24 13:34:26,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:26,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 13:34:26,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:26,859 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 13:34:26,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 (15)] Waiting until timeout for monitored process [2023-12-24 13:34:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:27,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 13:34:27,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:34:27,328 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:34:27,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:27,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980440368] [2023-12-24 13:34:27,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980440368] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:34:27,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:34:27,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 13:34:27,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200529211] [2023-12-24 13:34:27,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:34:27,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:34:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:34:27,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:34:27,330 INFO L87 Difference]: Start difference. First operand 145 states and 183 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:27,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:27,690 INFO L93 Difference]: Finished difference Result 362 states and 462 transitions. [2023-12-24 13:34:27,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:34:27,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2023-12-24 13:34:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:27,692 INFO L225 Difference]: With dead ends: 362 [2023-12-24 13:34:27,692 INFO L226 Difference]: Without dead ends: 218 [2023-12-24 13:34:27,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:34:27,693 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 101 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:27,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 817 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:34:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-12-24 13:34:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 145. [2023-12-24 13:34:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 118 states have internal predecessors, (146), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 182 transitions. [2023-12-24 13:34:27,729 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 182 transitions. Word has length 143 [2023-12-24 13:34:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:27,729 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 182 transitions. [2023-12-24 13:34:27,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 182 transitions. [2023-12-24 13:34:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-24 13:34:27,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:27,730 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:27,738 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 (15)] Ended with exit code 0 [2023-12-24 13:34:27,937 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 13:34:27,938 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:27,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:27,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1532867728, now seen corresponding path program 1 times [2023-12-24 13:34:27,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:27,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435487159] [2023-12-24 13:34:27,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:27,939 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 13:34:27,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:27,940 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 13:34:27,940 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 13:34:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:28,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 13:34:28,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:28,257 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 13:34:28,286 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 10 [2023-12-24 13:34:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:34:28,307 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:34:28,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:28,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435487159] [2023-12-24 13:34:28,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435487159] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:34:28,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:34:28,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 13:34:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612036124] [2023-12-24 13:34:28,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:34:28,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 13:34:28,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:28,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 13:34:28,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:34:28,308 INFO L87 Difference]: Start difference. First operand 145 states and 182 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:28,838 INFO L93 Difference]: Finished difference Result 374 states and 472 transitions. [2023-12-24 13:34:28,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 13:34:28,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2023-12-24 13:34:28,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:28,839 INFO L225 Difference]: With dead ends: 374 [2023-12-24 13:34:28,839 INFO L226 Difference]: Without dead ends: 230 [2023-12-24 13:34:28,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:34:28,840 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 179 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:28,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 769 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 13:34:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-12-24 13:34:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 144. [2023-12-24 13:34:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 117 states have (on average 1.2307692307692308) internal successors, (144), 117 states have internal predecessors, (144), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 180 transitions. [2023-12-24 13:34:28,850 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 180 transitions. Word has length 143 [2023-12-24 13:34:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:28,851 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 180 transitions. [2023-12-24 13:34:28,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 180 transitions. [2023-12-24 13:34:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-24 13:34:28,851 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:28,852 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:28,877 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 13:34:29,060 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 13:34:29,061 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:29,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:29,062 INFO L85 PathProgramCache]: Analyzing trace with hash 968738324, now seen corresponding path program 1 times [2023-12-24 13:34:29,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:29,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126814194] [2023-12-24 13:34:29,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:29,063 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 13:34:29,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:29,064 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 13:34:29,066 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 13:34:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:29,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 13:34:29,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:34:29,340 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:34:29,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:29,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126814194] [2023-12-24 13:34:29,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126814194] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:34:29,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:34:29,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 13:34:29,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934425822] [2023-12-24 13:34:29,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:34:29,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:34:29,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:29,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:34:29,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:34:29,341 INFO L87 Difference]: Start difference. First operand 144 states and 180 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:29,413 INFO L93 Difference]: Finished difference Result 302 states and 379 transitions. [2023-12-24 13:34:29,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:34:29,414 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2023-12-24 13:34:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:29,415 INFO L225 Difference]: With dead ends: 302 [2023-12-24 13:34:29,415 INFO L226 Difference]: Without dead ends: 159 [2023-12-24 13:34:29,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 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 13:34:29,418 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 78 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:29,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 650 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:34:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-12-24 13:34:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2023-12-24 13:34:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 121 states have (on average 1.2231404958677685) internal successors, (148), 121 states have internal predecessors, (148), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 184 transitions. [2023-12-24 13:34:29,431 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 184 transitions. Word has length 145 [2023-12-24 13:34:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:29,432 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 184 transitions. [2023-12-24 13:34:29,432 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 184 transitions. [2023-12-24 13:34:29,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-24 13:34:29,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:29,433 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:29,444 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 13:34:29,641 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 13:34:29,641 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:29,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:29,643 INFO L85 PathProgramCache]: Analyzing trace with hash -631279486, now seen corresponding path program 1 times [2023-12-24 13:34:29,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:29,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979424445] [2023-12-24 13:34:29,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:29,643 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 13:34:29,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:29,648 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 13:34:29,649 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 13:34:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:29,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:34:29,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:34:29,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:34:29,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:29,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979424445] [2023-12-24 13:34:29,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979424445] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:34:29,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:34:29,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:34:29,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084517825] [2023-12-24 13:34:29,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:34:29,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:34:29,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:29,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:34:29,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:34:29,959 INFO L87 Difference]: Start difference. First operand 148 states and 184 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:30,023 INFO L93 Difference]: Finished difference Result 303 states and 378 transitions. [2023-12-24 13:34:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:34:30,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2023-12-24 13:34:30,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:30,024 INFO L225 Difference]: With dead ends: 303 [2023-12-24 13:34:30,024 INFO L226 Difference]: Without dead ends: 156 [2023-12-24 13:34:30,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 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 13:34:30,025 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 32 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:30,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 528 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:34:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-24 13:34:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2023-12-24 13:34:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 124 states have (on average 1.217741935483871) internal successors, (151), 124 states have internal predecessors, (151), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 187 transitions. [2023-12-24 13:34:30,040 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 187 transitions. Word has length 147 [2023-12-24 13:34:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:30,040 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 187 transitions. [2023-12-24 13:34:30,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:30,040 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 187 transitions. [2023-12-24 13:34:30,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-24 13:34:30,042 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:30,042 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:30,052 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 13:34:30,252 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 13:34:30,252 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:30,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:30,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2053267913, now seen corresponding path program 1 times [2023-12-24 13:34:30,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:30,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847087155] [2023-12-24 13:34:30,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:30,253 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 13:34:30,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:30,254 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 13:34:30,255 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 13:34:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:30,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 13:34:30,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:30,558 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:34:30,559 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:34:30,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:30,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847087155] [2023-12-24 13:34:30,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847087155] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:34:30,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:34:30,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 13:34:30,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084114813] [2023-12-24 13:34:30,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:34:30,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:34:30,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:30,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:34:30,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:34:30,560 INFO L87 Difference]: Start difference. First operand 151 states and 187 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:30,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:30,708 INFO L93 Difference]: Finished difference Result 334 states and 415 transitions. [2023-12-24 13:34:30,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 13:34:30,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2023-12-24 13:34:30,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:30,709 INFO L225 Difference]: With dead ends: 334 [2023-12-24 13:34:30,709 INFO L226 Difference]: Without dead ends: 184 [2023-12-24 13:34:30,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 141 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 13:34:30,711 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 98 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:30,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 800 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:34:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-12-24 13:34:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 152. [2023-12-24 13:34:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 125 states have (on average 1.216) internal successors, (152), 125 states have internal predecessors, (152), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 188 transitions. [2023-12-24 13:34:30,723 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 188 transitions. Word has length 147 [2023-12-24 13:34:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:30,724 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 188 transitions. [2023-12-24 13:34:30,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2023-12-24 13:34:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-24 13:34:30,724 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:30,725 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:30,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-24 13:34:30,932 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 13:34:30,933 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:30,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:30,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1205312155, now seen corresponding path program 1 times [2023-12-24 13:34:30,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:30,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233549106] [2023-12-24 13:34:30,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:30,934 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 13:34:30,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:30,953 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 13:34:30,997 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 13:34:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:31,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 13:34:31,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:31,415 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 1 [2023-12-24 13:34:31,426 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 21 treesize of output 21 [2023-12-24 13:34:31,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:34:31,525 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 37 treesize of output 17 [2023-12-24 13:34:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:34:31,572 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:34:31,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:31,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233549106] [2023-12-24 13:34:31,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233549106] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:34:31,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:34:31,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 13:34:31,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163231843] [2023-12-24 13:34:31,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:34:31,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 13:34:31,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:31,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 13:34:31,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-24 13:34:31,575 INFO L87 Difference]: Start difference. First operand 152 states and 188 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:31,955 INFO L93 Difference]: Finished difference Result 386 states and 478 transitions. [2023-12-24 13:34:31,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 13:34:31,955 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2023-12-24 13:34:31,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:31,956 INFO L225 Difference]: With dead ends: 386 [2023-12-24 13:34:31,956 INFO L226 Difference]: Without dead ends: 235 [2023-12-24 13:34:31,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-12-24 13:34:31,957 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 172 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:31,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1268 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:34:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-12-24 13:34:31,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 151. [2023-12-24 13:34:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 124 states have (on average 1.217741935483871) internal successors, (151), 124 states have internal predecessors, (151), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 13:34:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 187 transitions. [2023-12-24 13:34:31,967 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 187 transitions. Word has length 149 [2023-12-24 13:34:31,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:31,968 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 187 transitions. [2023-12-24 13:34:31,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:31,968 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 187 transitions. [2023-12-24 13:34:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-24 13:34:31,968 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:31,969 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:31,981 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 13:34:32,177 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 13:34:32,178 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:32,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:32,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1593968249, now seen corresponding path program 1 times [2023-12-24 13:34:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:32,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002143310] [2023-12-24 13:34:32,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:32,179 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 13:34:32,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:32,180 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 13:34:32,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-24 13:34:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:32,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 13:34:32,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:32,603 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 8 treesize of output 1 [2023-12-24 13:34:32,702 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 37 treesize of output 30 [2023-12-24 13:34:33,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:34:33,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 54 treesize of output 53 [2023-12-24 13:34:33,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:34:33,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 113 treesize of output 88 [2023-12-24 13:34:33,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:34:33,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 106 [2023-12-24 13:34:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 158 proven. 84 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2023-12-24 13:34:33,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:34:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:34:34,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:34,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002143310] [2023-12-24 13:34:34,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002143310] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:34:34,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:34:34,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 19 [2023-12-24 13:34:34,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240326906] [2023-12-24 13:34:34,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:34:34,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:34:34,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:34,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:34:34,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-12-24 13:34:34,301 INFO L87 Difference]: Start difference. First operand 151 states and 187 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:34,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:34:34,733 INFO L93 Difference]: Finished difference Result 229 states and 284 transitions. [2023-12-24 13:34:34,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:34:34,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2023-12-24 13:34:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:34:34,735 INFO L225 Difference]: With dead ends: 229 [2023-12-24 13:34:34,735 INFO L226 Difference]: Without dead ends: 227 [2023-12-24 13:34:34,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2023-12-24 13:34:34,736 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 57 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:34:34,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 631 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:34:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-12-24 13:34:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2023-12-24 13:34:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 194 states have (on average 1.2371134020618557) internal successors, (240), 195 states have internal predecessors, (240), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:34:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 280 transitions. [2023-12-24 13:34:34,749 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 280 transitions. Word has length 149 [2023-12-24 13:34:34,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:34:34,750 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 280 transitions. [2023-12-24 13:34:34,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:34:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 280 transitions. [2023-12-24 13:34:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-24 13:34:34,751 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:34:34,751 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:34,765 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 13:34:34,962 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 13:34:34,962 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:34:34,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:34:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1792994821, now seen corresponding path program 1 times [2023-12-24 13:34:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:34:34,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923539793] [2023-12-24 13:34:34,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:34:34,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:34:34,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:34:34,964 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 13:34:34,966 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 13:34:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:34:35,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 13:34:35,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:34:47,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:34:47,020 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 309 treesize of output 105 [2023-12-24 13:34:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2023-12-24 13:34:52,029 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:34:52,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:34:52,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923539793] [2023-12-24 13:34:52,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923539793] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:34:52,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:34:52,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 13:34:52,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281332076] [2023-12-24 13:34:52,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:34:52,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 13:34:52,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:34:52,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 13:34:52,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:34:52,030 INFO L87 Difference]: Start difference. First operand 224 states and 280 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-24 13:35:21,501 WARN L293 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 75 DAG size of output: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 13:35:24,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 13:35:26,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 13:35:41,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:35:41,991 INFO L93 Difference]: Finished difference Result 665 states and 824 transitions. [2023-12-24 13:35:41,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 13:35:41,992 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2023-12-24 13:35:41,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:35:41,993 INFO L225 Difference]: With dead ends: 665 [2023-12-24 13:35:41,994 INFO L226 Difference]: Without dead ends: 442 [2023-12-24 13:35:41,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2023-12-24 13:35:41,994 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 325 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:35:41,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 986 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 35.0s Time] [2023-12-24 13:35:41,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2023-12-24 13:35:42,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 432. [2023-12-24 13:35:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 368 states have (on average 1.2065217391304348) internal successors, (444), 371 states have internal predecessors, (444), 44 states have call successors, (44), 19 states have call predecessors, (44), 19 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-24 13:35:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 532 transitions. [2023-12-24 13:35:42,024 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 532 transitions. Word has length 149 [2023-12-24 13:35:42,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:35:42,025 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 532 transitions. [2023-12-24 13:35:42,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-24 13:35:42,025 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 532 transitions. [2023-12-24 13:35:42,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-24 13:35:42,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:35:42,026 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:35:42,036 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 13:35:42,234 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 13:35:42,234 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:35:42,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:35:42,235 INFO L85 PathProgramCache]: Analyzing trace with hash 635263801, now seen corresponding path program 1 times [2023-12-24 13:35:42,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:35:42,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285779892] [2023-12-24 13:35:42,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:35:42,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:35:42,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:35:42,236 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 13:35:42,238 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 13:35:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:35:42,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:35:42,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:35:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2023-12-24 13:35:42,512 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:35:42,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:35:42,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285779892] [2023-12-24 13:35:42,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285779892] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:35:42,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:35:42,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:35:42,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173904691] [2023-12-24 13:35:42,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:35:42,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:35:42,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:35:42,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:35:42,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:35:42,513 INFO L87 Difference]: Start difference. First operand 432 states and 532 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-24 13:35:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:35:42,600 INFO L93 Difference]: Finished difference Result 867 states and 1069 transitions. [2023-12-24 13:35:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:35:42,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2023-12-24 13:35:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:35:42,602 INFO L225 Difference]: With dead ends: 867 [2023-12-24 13:35:42,602 INFO L226 Difference]: Without dead ends: 436 [2023-12-24 13:35:42,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 146 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 13:35:42,603 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 7 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:35:42,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 414 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:35:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-12-24 13:35:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2023-12-24 13:35:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 368 states have (on average 1.203804347826087) internal successors, (443), 371 states have internal predecessors, (443), 44 states have call successors, (44), 19 states have call predecessors, (44), 19 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-24 13:35:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 531 transitions. [2023-12-24 13:35:42,628 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 531 transitions. Word has length 149 [2023-12-24 13:35:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:35:42,629 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 531 transitions. [2023-12-24 13:35:42,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-24 13:35:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 531 transitions. [2023-12-24 13:35:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-24 13:35:42,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:35:42,630 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:35:42,637 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 (23)] Ended with exit code 0 [2023-12-24 13:35:42,837 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 13:35:42,837 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:35:42,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:35:42,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1250290291, now seen corresponding path program 1 times [2023-12-24 13:35:42,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:35:42,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027927389] [2023-12-24 13:35:42,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:35:42,838 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 13:35:42,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:35:42,839 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 13:35:42,841 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 13:35:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:35:55,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 13:35:55,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:36:17,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:36:17,618 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 309 treesize of output 105 [2023-12-24 13:36:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2023-12-24 13:36:20,365 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:36:20,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:36:20,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027927389] [2023-12-24 13:36:20,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027927389] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:36:20,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:36:20,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 13:36:20,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907269466] [2023-12-24 13:36:20,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:36:20,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 13:36:20,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:36:20,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 13:36:20,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:36:20,366 INFO L87 Difference]: Start difference. First operand 432 states and 531 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-24 13:36:42,306 WARN L293 SmtUtils]: Spent 7.04s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 13:36:45,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 13:37:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:37:00,375 INFO L93 Difference]: Finished difference Result 866 states and 1063 transitions. [2023-12-24 13:37:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 13:37:00,376 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2023-12-24 13:37:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:37:00,378 INFO L225 Difference]: With dead ends: 866 [2023-12-24 13:37:00,378 INFO L226 Difference]: Without dead ends: 435 [2023-12-24 13:37:00,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-12-24 13:37:00,379 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 246 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.9s IncrementalHoareTripleChecker+Time [2023-12-24 13:37:00,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 818 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 28.9s Time] [2023-12-24 13:37:00,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2023-12-24 13:37:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 427. [2023-12-24 13:37:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 363 states have (on average 1.1983471074380165) internal successors, (435), 366 states have internal predecessors, (435), 44 states have call successors, (44), 19 states have call predecessors, (44), 19 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-24 13:37:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 523 transitions. [2023-12-24 13:37:00,406 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 523 transitions. Word has length 151 [2023-12-24 13:37:00,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:37:00,407 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 523 transitions. [2023-12-24 13:37:00,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-24 13:37:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 523 transitions. [2023-12-24 13:37:00,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-24 13:37:00,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:37:00,408 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:00,422 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 13:37:00,620 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 13:37:00,620 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:37:00,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:37:00,620 INFO L85 PathProgramCache]: Analyzing trace with hash -210385107, now seen corresponding path program 1 times [2023-12-24 13:37:00,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:37:00,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128622615] [2023-12-24 13:37:00,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:37:00,621 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 13:37:00,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:37:00,622 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 13:37:00,655 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 13:37:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:37:13,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 13:37:13,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:37:44,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:37:44,087 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 310 treesize of output 106 [2023-12-24 13:37:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2023-12-24 13:37:47,729 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:37:47,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:37:47,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128622615] [2023-12-24 13:37:47,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128622615] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:37:47,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:37:47,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 13:37:47,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664220125] [2023-12-24 13:37:47,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:37:47,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 13:37:47,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:37:47,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 13:37:47,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:37:47,730 INFO L87 Difference]: Start difference. First operand 427 states and 523 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-24 13:38:05,763 WARN L293 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 13:38:07,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 13:38:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:38:13,719 INFO L93 Difference]: Finished difference Result 866 states and 1058 transitions. [2023-12-24 13:38:13,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 13:38:13,738 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2023-12-24 13:38:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:38:13,740 INFO L225 Difference]: With dead ends: 866 [2023-12-24 13:38:13,740 INFO L226 Difference]: Without dead ends: 440 [2023-12-24 13:38:13,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-12-24 13:38:13,741 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 282 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:38:13,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 980 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 15.2s Time] [2023-12-24 13:38:13,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2023-12-24 13:38:13,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 431. [2023-12-24 13:38:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 366 states have (on average 1.1939890710382515) internal successors, (437), 369 states have internal predecessors, (437), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-24 13:38:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 525 transitions. [2023-12-24 13:38:13,767 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 525 transitions. Word has length 151 [2023-12-24 13:38:13,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:38:13,768 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 525 transitions. [2023-12-24 13:38:13,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-24 13:38:13,768 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 525 transitions. [2023-12-24 13:38:13,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-24 13:38:13,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:38:13,769 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:38:13,805 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 13:38:13,969 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 13:38:13,969 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:38:13,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:38:13,970 INFO L85 PathProgramCache]: Analyzing trace with hash -409411679, now seen corresponding path program 1 times [2023-12-24 13:38:13,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:38:13,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880812090] [2023-12-24 13:38:13,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:38:13,970 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 13:38:13,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:38:13,984 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 13:38:14,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-24 13:38:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:38:14,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 13:38:14,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:38:16,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:38:16,091 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 303 treesize of output 99 [2023-12-24 13:38:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2023-12-24 13:38:16,212 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:38:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:38:16,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:38:16,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880812090] [2023-12-24 13:38:16,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880812090] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:38:16,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:38:16,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2023-12-24 13:38:16,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846985132] [2023-12-24 13:38:16,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:38:16,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:38:16,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:38:16,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:38:16,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-24 13:38:16,518 INFO L87 Difference]: Start difference. First operand 431 states and 525 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:38:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:38:16,811 INFO L93 Difference]: Finished difference Result 1054 states and 1274 transitions. [2023-12-24 13:38:16,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:38:16,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2023-12-24 13:38:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:38:16,832 INFO L225 Difference]: With dead ends: 1054 [2023-12-24 13:38:16,832 INFO L226 Difference]: Without dead ends: 624 [2023-12-24 13:38:16,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-24 13:38:16,834 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 115 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:38:16,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 393 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:38:16,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2023-12-24 13:38:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 540. [2023-12-24 13:38:16,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 465 states have (on average 1.1698924731182796) internal successors, (544), 470 states have internal predecessors, (544), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-24 13:38:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 648 transitions. [2023-12-24 13:38:16,892 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 648 transitions. Word has length 151 [2023-12-24 13:38:16,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:38:16,892 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 648 transitions. [2023-12-24 13:38:16,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:38:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 648 transitions. [2023-12-24 13:38:16,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-24 13:38:16,905 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:38:16,905 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:38:16,918 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 13:38:17,112 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 13:38:17,113 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:38:17,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:38:17,113 INFO L85 PathProgramCache]: Analyzing trace with hash -797804530, now seen corresponding path program 1 times [2023-12-24 13:38:17,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:38:17,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36258913] [2023-12-24 13:38:17,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:38:17,114 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 13:38:17,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:38:17,114 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 13:38:17,148 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 13:38:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:38:17,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:38:17,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:38:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:38:17,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:38:17,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:38:17,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36258913] [2023-12-24 13:38:17,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36258913] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:38:17,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:38:17,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:38:17,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867916866] [2023-12-24 13:38:17,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:38:17,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:38:17,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:38:17,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:38:17,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:38:17,496 INFO L87 Difference]: Start difference. First operand 540 states and 648 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:38:18,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:38:18,958 INFO L93 Difference]: Finished difference Result 1465 states and 1747 transitions. [2023-12-24 13:38:18,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:38:18,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2023-12-24 13:38:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:38:18,962 INFO L225 Difference]: With dead ends: 1465 [2023-12-24 13:38:18,962 INFO L226 Difference]: Without dead ends: 926 [2023-12-24 13:38:18,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:38:18,963 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 134 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:38:18,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 571 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-24 13:38:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2023-12-24 13:38:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 591. [2023-12-24 13:38:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 516 states have (on average 1.1589147286821706) internal successors, (598), 521 states have internal predecessors, (598), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-24 13:38:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 702 transitions. [2023-12-24 13:38:19,003 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 702 transitions. Word has length 152 [2023-12-24 13:38:19,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:38:19,003 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 702 transitions. [2023-12-24 13:38:19,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:38:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 702 transitions. [2023-12-24 13:38:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-24 13:38:19,004 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:38:19,004 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:38:19,026 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 13:38:19,212 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 13:38:19,212 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:38:19,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:38:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash 205552312, now seen corresponding path program 1 times [2023-12-24 13:38:19,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:38:19,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82822536] [2023-12-24 13:38:19,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:38:19,213 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 13:38:19,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:38:19,214 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 13:38:19,217 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 13:38:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:38:19,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 13:38:19,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:38:19,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 13:38:19,659 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 31 treesize of output 15 [2023-12-24 13:38:19,773 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 26 treesize of output 25 [2023-12-24 13:38:20,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:38:20,827 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 1 case distinctions, treesize of input 43 treesize of output 39 [2023-12-24 13:38:21,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:38:21,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 42 [2023-12-24 13:38:21,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:38:21,132 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 49 treesize of output 19 [2023-12-24 13:38:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 195 proven. 48 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2023-12-24 13:38:21,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:38:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-24 13:38:21,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:38:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82822536] [2023-12-24 13:38:21,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82822536] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:38:21,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:38:21,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-12-24 13:38:21,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016166337] [2023-12-24 13:38:21,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:38:21,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 13:38:21,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:38:21,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 13:38:21,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-12-24 13:38:21,813 INFO L87 Difference]: Start difference. First operand 591 states and 702 transitions. Second operand has 14 states, 12 states have (on average 9.5) internal successors, (114), 14 states have internal predecessors, (114), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) [2023-12-24 13:38:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:38:24,223 INFO L93 Difference]: Finished difference Result 1127 states and 1312 transitions. [2023-12-24 13:38:24,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 13:38:24,224 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.5) internal successors, (114), 14 states have internal predecessors, (114), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) Word has length 153 [2023-12-24 13:38:24,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:38:24,226 INFO L225 Difference]: With dead ends: 1127 [2023-12-24 13:38:24,226 INFO L226 Difference]: Without dead ends: 537 [2023-12-24 13:38:24,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2023-12-24 13:38:24,228 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 132 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-24 13:38:24,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 430 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-24 13:38:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2023-12-24 13:38:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 464. [2023-12-24 13:38:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 397 states have (on average 1.105793450881612) internal successors, (439), 399 states have internal predecessors, (439), 42 states have call successors, (42), 24 states have call predecessors, (42), 24 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-24 13:38:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 523 transitions. [2023-12-24 13:38:24,263 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 523 transitions. Word has length 153 [2023-12-24 13:38:24,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:38:24,264 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 523 transitions. [2023-12-24 13:38:24,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 9.5) internal successors, (114), 14 states have internal predecessors, (114), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) [2023-12-24 13:38:24,264 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 523 transitions. [2023-12-24 13:38:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-24 13:38:24,265 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:38:24,265 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:38:24,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-24 13:38:24,473 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 13:38:24,474 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:38:24,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:38:24,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1228214707, now seen corresponding path program 1 times [2023-12-24 13:38:24,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:38:24,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774833500] [2023-12-24 13:38:24,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:38:24,475 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 13:38:24,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:38:24,476 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 13:38:24,476 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 13:38:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:38:24,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-24 13:38:24,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:38:24,922 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 1 [2023-12-24 13:38:25,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:38:25,951 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 1 case distinctions, treesize of input 44 treesize of output 40 [2023-12-24 13:38:26,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:38:26,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 54 treesize of output 53 [2023-12-24 13:38:27,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:38:27,049 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 87 treesize of output 39 [2023-12-24 13:38:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 248 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2023-12-24 13:38:27,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:38:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:38:28,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:38:28,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774833500] [2023-12-24 13:38:28,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774833500] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:38:28,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:38:28,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 24 [2023-12-24 13:38:28,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947023062] [2023-12-24 13:38:28,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:38:28,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 13:38:28,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:38:28,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 13:38:28,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2023-12-24 13:38:28,487 INFO L87 Difference]: Start difference. First operand 464 states and 523 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:38:30,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:38:30,389 INFO L93 Difference]: Finished difference Result 676 states and 761 transitions. [2023-12-24 13:38:30,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 13:38:30,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2023-12-24 13:38:30,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:38:30,391 INFO L225 Difference]: With dead ends: 676 [2023-12-24 13:38:30,391 INFO L226 Difference]: Without dead ends: 674 [2023-12-24 13:38:30,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2023-12-24 13:38:30,392 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 59 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:38:30,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1149 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-24 13:38:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2023-12-24 13:38:30,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 593. [2023-12-24 13:38:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 526 states have (on average 1.1102661596958174) internal successors, (584), 528 states have internal predecessors, (584), 42 states have call successors, (42), 24 states have call predecessors, (42), 24 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-24 13:38:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 668 transitions. [2023-12-24 13:38:30,433 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 668 transitions. Word has length 153 [2023-12-24 13:38:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:38:30,434 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 668 transitions. [2023-12-24 13:38:30,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:38:30,434 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 668 transitions. [2023-12-24 13:38:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-24 13:38:30,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:38:30,435 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:38:30,450 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 13:38:30,646 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 13:38:30,646 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:38:30,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:38:30,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1285473009, now seen corresponding path program 1 times [2023-12-24 13:38:30,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:38:30,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651642359] [2023-12-24 13:38:30,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:38:30,647 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 13:38:30,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:38:30,648 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:38:30,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-24 13:38:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:38:31,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 13:38:31,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:38:31,105 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 13:38:31,514 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 52 treesize of output 24 [2023-12-24 13:38:32,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:38:32,823 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 1 case distinctions, treesize of input 54 treesize of output 44 [2023-12-24 13:38:33,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:38:33,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 47 treesize of output 37 [2023-12-24 13:38:33,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:38:33,600 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 55 treesize of output 25 [2023-12-24 13:38:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 160 proven. 84 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2023-12-24 13:38:33,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:38:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 84 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2023-12-24 13:38:34,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:38:34,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651642359] [2023-12-24 13:38:34,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651642359] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:38:34,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:38:34,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2023-12-24 13:38:34,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086838521] [2023-12-24 13:38:34,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:38:34,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-24 13:38:34,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:38:34,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-24 13:38:34,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-12-24 13:38:34,369 INFO L87 Difference]: Start difference. First operand 593 states and 668 transitions. Second operand has 18 states, 14 states have (on average 9.428571428571429) internal successors, (132), 16 states have internal predecessors, (132), 7 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 7 states have call successors, (34) [2023-12-24 13:38:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:38:36,731 INFO L93 Difference]: Finished difference Result 1211 states and 1358 transitions. [2023-12-24 13:38:36,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-24 13:38:36,732 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 9.428571428571429) internal successors, (132), 16 states have internal predecessors, (132), 7 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 7 states have call successors, (34) Word has length 153 [2023-12-24 13:38:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:38:36,733 INFO L225 Difference]: With dead ends: 1211 [2023-12-24 13:38:36,733 INFO L226 Difference]: Without dead ends: 619 [2023-12-24 13:38:36,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2023-12-24 13:38:36,734 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 86 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-24 13:38:36,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 558 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-24 13:38:36,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2023-12-24 13:38:36,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 605. [2023-12-24 13:38:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 535 states have (on average 1.097196261682243) internal successors, (587), 537 states have internal predecessors, (587), 42 states have call successors, (42), 27 states have call predecessors, (42), 27 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-24 13:38:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 671 transitions. [2023-12-24 13:38:36,776 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 671 transitions. Word has length 153 [2023-12-24 13:38:36,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:38:36,776 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 671 transitions. [2023-12-24 13:38:36,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 9.428571428571429) internal successors, (132), 16 states have internal predecessors, (132), 7 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 7 states have call successors, (34) [2023-12-24 13:38:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 671 transitions. [2023-12-24 13:38:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-24 13:38:36,777 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:38:36,777 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:38:36,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-12-24 13:38:36,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:38:36,988 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:38:36,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:38:36,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1502974321, now seen corresponding path program 1 times [2023-12-24 13:38:36,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:38:36,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573996908] [2023-12-24 13:38:36,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:38:36,989 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 13:38:36,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:38:37,004 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:38:37,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-24 13:38:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:38:37,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 13:38:37,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:38:37,522 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 8 treesize of output 1 [2023-12-24 13:38:37,771 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 42 treesize of output 20 [2023-12-24 13:38:38,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:38:38,598 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 1 case distinctions, treesize of input 44 treesize of output 40 [2023-12-24 13:38:38,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:38:38,754 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 67 treesize of output 31 [2023-12-24 13:38:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 158 proven. 84 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2023-12-24 13:38:38,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:38:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 84 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2023-12-24 13:38:39,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:38:39,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573996908] [2023-12-24 13:38:39,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573996908] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:38:39,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:38:39,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2023-12-24 13:38:39,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159447437] [2023-12-24 13:38:39,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:38:39,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 13:38:39,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:38:39,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 13:38:39,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-24 13:38:39,412 INFO L87 Difference]: Start difference. First operand 605 states and 671 transitions. Second operand has 16 states, 12 states have (on average 8.833333333333334) internal successors, (106), 16 states have internal predecessors, (106), 7 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 3 states have call predecessors, (34), 7 states have call successors, (34) [2023-12-24 13:38:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:38:41,414 INFO L93 Difference]: Finished difference Result 1095 states and 1213 transitions. [2023-12-24 13:38:41,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 13:38:41,415 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 8.833333333333334) internal successors, (106), 16 states have internal predecessors, (106), 7 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 3 states have call predecessors, (34), 7 states have call successors, (34) Word has length 153 [2023-12-24 13:38:41,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:38:41,416 INFO L225 Difference]: With dead ends: 1095 [2023-12-24 13:38:41,416 INFO L226 Difference]: Without dead ends: 491 [2023-12-24 13:38:41,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2023-12-24 13:38:41,418 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 224 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-24 13:38:41,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 551 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-24 13:38:41,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-12-24 13:38:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2023-12-24 13:38:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 407 states have (on average 1.0884520884520885) internal successors, (443), 409 states have internal predecessors, (443), 42 states have call successors, (42), 27 states have call predecessors, (42), 27 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-24 13:38:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 527 transitions. [2023-12-24 13:38:41,457 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 527 transitions. Word has length 153 [2023-12-24 13:38:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:38:41,457 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 527 transitions. [2023-12-24 13:38:41,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 8.833333333333334) internal successors, (106), 16 states have internal predecessors, (106), 7 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 3 states have call predecessors, (34), 7 states have call successors, (34) [2023-12-24 13:38:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 527 transitions. [2023-12-24 13:38:41,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-24 13:38:41,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:38:41,458 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:38:41,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-12-24 13:38:41,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:38:41,669 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:38:41,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:38:41,669 INFO L85 PathProgramCache]: Analyzing trace with hash -133140281, now seen corresponding path program 1 times [2023-12-24 13:38:41,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:38:41,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003985480] [2023-12-24 13:38:41,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:38:41,670 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 13:38:41,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:38:41,671 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:38:41,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-24 13:38:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:38:46,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 13:38:46,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:39:16,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:39:16,257 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 307 treesize of output 103 [2023-12-24 13:39:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 318 proven. 30 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 13:39:19,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:39:54,693 WARN L293 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 13:39:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:39:54,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:39:54,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003985480] [2023-12-24 13:39:54,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003985480] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:39:54,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:39:54,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2023-12-24 13:39:54,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126492491] [2023-12-24 13:39:54,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:39:54,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:39:54,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:39:54,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:39:54,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-12-24 13:39:54,762 INFO L87 Difference]: Start difference. First operand 477 states and 527 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:40:04,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:40:12,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:40:14,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:40:25,183 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 33.0 2.0))))) (and (let ((.cse1 (select |c_#memory_int#2| |c_~#double_Array_0~0.base|))) (fp.gt (fp.mul c_currentRoundingMode (let ((.cse0 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) .cse2) (let ((.cse3 (concat (select .cse1 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (select .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.gt (fp.mul c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem128#1| .cse2) |c_ULTIMATE.start_property_#t~mem129#1|))) is different from false [2023-12-24 13:40:29,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:40:33,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:40:35,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:40:35,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:40:35,592 INFO L93 Difference]: Finished difference Result 978 states and 1080 transitions. [2023-12-24 13:40:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:40:35,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2023-12-24 13:40:35,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:40:35,615 INFO L225 Difference]: With dead ends: 978 [2023-12-24 13:40:35,615 INFO L226 Difference]: Without dead ends: 502 [2023-12-24 13:40:35,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=55, Invalid=188, Unknown=1, NotChecked=28, Total=272 [2023-12-24 13:40:35,616 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 33 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 36.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:40:35,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 434 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 4 Unchecked, 36.0s Time] [2023-12-24 13:40:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2023-12-24 13:40:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 473. [2023-12-24 13:40:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 403 states have (on average 1.0843672456575681) internal successors, (437), 405 states have internal predecessors, (437), 42 states have call successors, (42), 27 states have call predecessors, (42), 27 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-24 13:40:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 521 transitions. [2023-12-24 13:40:35,668 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 521 transitions. Word has length 153 [2023-12-24 13:40:35,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:40:35,668 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 521 transitions. [2023-12-24 13:40:35,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:40:35,668 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 521 transitions. [2023-12-24 13:40:35,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-24 13:40:35,669 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:40:35,669 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:40:35,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-12-24 13:40:35,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:40:35,881 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:40:35,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:40:35,882 INFO L85 PathProgramCache]: Analyzing trace with hash 906764903, now seen corresponding path program 1 times [2023-12-24 13:40:35,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:40:35,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075863900] [2023-12-24 13:40:35,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:40:35,882 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 13:40:35,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:40:35,883 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:40:35,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-24 13:40:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:40:40,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 13:40:40,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:41:10,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:41:10,124 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 308 treesize of output 104 [2023-12-24 13:41:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 318 proven. 30 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 13:41:13,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:41:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 13:41:51,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:41:51,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075863900] [2023-12-24 13:41:51,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075863900] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:41:51,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:41:51,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2023-12-24 13:41:51,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882887196] [2023-12-24 13:41:51,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:41:51,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:41:51,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:41:51,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:41:51,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-12-24 13:41:51,066 INFO L87 Difference]: Start difference. First operand 473 states and 521 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:41:55,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:42:01,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:42:03,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:42:07,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:42:20,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:42:25,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:42:31,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:42:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:31,062 INFO L93 Difference]: Finished difference Result 1035 states and 1136 transitions. [2023-12-24 13:42:31,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:42:31,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2023-12-24 13:42:31,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:31,153 INFO L225 Difference]: With dead ends: 1035 [2023-12-24 13:42:31,153 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 13:42:31,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2023-12-24 13:42:31,155 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 70 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.5s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:31,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 402 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 1 Unknown, 0 Unchecked, 35.5s Time] [2023-12-24 13:42:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 13:42:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 13:42:31,155 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 13:42:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 13:42:31,155 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2023-12-24 13:42:31,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:31,156 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 13:42:31,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 13:42:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 13:42:31,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 13:42:31,158 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 13:42:31,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:31,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:42:31,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 13:42:51,875 WARN L293 SmtUtils]: Spent 13.32s on a formula simplification. DAG size of input: 169 DAG size of output: 185 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:43:04,407 WARN L293 SmtUtils]: Spent 8.56s on a formula simplification. DAG size of input: 142 DAG size of output: 155 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:43:15,833 WARN L293 SmtUtils]: Spent 9.32s on a formula simplification. DAG size of input: 189 DAG size of output: 192 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:43:33,836 WARN L293 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 171 DAG size of output: 185 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:43:42,830 WARN L293 SmtUtils]: Spent 6.64s on a formula simplification. DAG size of input: 171 DAG size of output: 185 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:43:57,913 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification. DAG size of input: 142 DAG size of output: 155 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:44:09,104 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification. DAG size of input: 170 DAG size of output: 183 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:44:24,760 WARN L293 SmtUtils]: Spent 10.97s on a formula simplification. DAG size of input: 188 DAG size of output: 208 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:44:41,759 WARN L293 SmtUtils]: Spent 13.23s on a formula simplification. DAG size of input: 169 DAG size of output: 185 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:44:56,494 WARN L293 SmtUtils]: Spent 11.38s on a formula simplification. DAG size of input: 188 DAG size of output: 208 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:45:05,140 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification. DAG size of input: 170 DAG size of output: 183 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:45:14,467 WARN L293 SmtUtils]: Spent 9.00s on a formula simplification. DAG size of input: 189 DAG size of output: 192 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:45:47,023 WARN L293 SmtUtils]: Spent 19.78s on a formula simplification. DAG size of input: 194 DAG size of output: 53 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:46:00,094 WARN L293 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 184 DAG size of output: 52 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:47:24,386 WARN L293 SmtUtils]: Spent 1.40m on a formula simplification. DAG size of input: 713 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:47:37,237 WARN L293 SmtUtils]: Spent 12.40s on a formula simplification. DAG size of input: 236 DAG size of output: 59 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:47:46,055 WARN L293 SmtUtils]: Spent 7.27s on a formula simplification. DAG size of input: 186 DAG size of output: 54 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:47:58,338 WARN L293 SmtUtils]: Spent 9.47s on a formula simplification. DAG size of input: 188 DAG size of output: 47 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:47:58,341 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 13:47:58,341 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 13:47:58,341 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 13:47:58,342 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 13:47:58,342 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse4 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse5 (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) .cse5))) (.cse3 (select .cse0 (_ bv8 32))) (.cse2 (select .cse0 (_ bv12 32)))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (bvsle .cse1 (_ bv1 32)) (bvuge .cse2 (_ bv1073741823 32)) (bvsge .cse1 (_ bv1 32)) (bvuge .cse3 (_ bv536870911 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (= .cse3 |ULTIMATE.start_updateVariables_#t~mem75#1|) (bvule .cse2 (_ bv2147483647 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse5)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (bvule (select .cse0 (_ bv4 32)) (_ bv536870911 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet48#1_45| (_ BitVec 8))) (= (select .cse4 (bvadd (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet48#1_45|))))))) [2023-12-24 13:47:58,342 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-12-24 13:47:58,342 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 56) no Hoare annotation was computed. [2023-12-24 13:47:58,342 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 13:47:58,342 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 13:47:58,342 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 13:47:58,342 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse4 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse5 (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse1 ((_ extract 7 0) .cse5)) (.cse3 (select .cse0 (_ bv8 32))) (.cse2 (select .cse0 (_ bv12 32)))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (= |ULTIMATE.start_updateVariables_#t~mem47#1| .cse1) (bvuge .cse2 (_ bv1073741823 32)) (bvsge ((_ zero_extend 24) .cse1) (_ bv1 32)) (bvuge .cse3 (_ bv536870911 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (bvule .cse2 (_ bv2147483647 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse5)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (bvule (select .cse0 (_ bv4 32)) (_ bv536870911 32)))))) [2023-12-24 13:47:58,342 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-12-24 13:47:58,342 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 62) no Hoare annotation was computed. [2023-12-24 13:47:58,343 INFO L895 garLoopResultBuilder]: At program point L102-2(lines 102 108) the Hoare annotation is: (let ((.cse4 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|))) (let ((.cse3 (select .cse0 (_ bv8 32))) (.cse2 (select .cse0 (_ bv12 32))) (.cse1 ((_ extract 7 0) (select .cse4 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|))))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (= ((_ zero_extend 24) .cse1) (_ bv0 32)) (bvuge .cse2 (_ bv1073741823 32)) (bvuge .cse3 (_ bv536870911 32)) (bvule .cse3 (_ bv1073741823 32)) (bvule .cse2 (_ bv2147483647 32)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= ((_ sign_extend 24) .cse1) (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (let ((.cse5 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) .cse5)))) (and (= .cse5 (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (bvsge .cse6 (_ bv1 32)) (bvsle .cse6 (_ bv1 32)))))) (= currentRoundingMode roundNearestTiesToEven) (bvule (select .cse0 (_ bv4 32)) (_ bv536870911 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet48#1_45| (_ BitVec 8))) (= (select .cse4 (bvadd (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet48#1_45|)))))) [2023-12-24 13:47:58,343 INFO L899 garLoopResultBuilder]: For program point L102-3(lines 102 108) no Hoare annotation was computed. [2023-12-24 13:47:58,343 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-24 13:47:58,343 INFO L899 garLoopResultBuilder]: For program point L53-2(line 53) no Hoare annotation was computed. [2023-12-24 13:47:58,343 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse3 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse4 (select .cse3 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) .cse4))) (.cse2 (select .cse0 (_ bv8 32)))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (bvsle .cse1 (_ bv1 32)) (bvsge .cse1 (_ bv1 32)) (bvuge .cse2 (_ bv536870911 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (bvule .cse2 (_ bv1073741823 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse4)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= (select .cse0 (_ bv12 32)) |ULTIMATE.start_updateVariables_#t~mem77#1|) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse3 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (bvule (select .cse0 (_ bv4 32)) (_ bv536870911 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet48#1_45| (_ BitVec 8))) (= (select .cse3 (bvadd (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet48#1_45|))))))) [2023-12-24 13:47:58,343 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-12-24 13:47:58,343 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse4 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse5 (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) .cse5))) (.cse3 (select .cse0 (_ bv8 32))) (.cse2 (select .cse0 (_ bv12 32)))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (bvsle .cse1 (_ bv1 32)) (bvuge .cse2 (_ bv1073741823 32)) (bvsge .cse1 (_ bv1 32)) (bvuge .cse3 (_ bv536870911 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (bvule .cse2 (_ bv2147483647 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse5)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (bvule (select .cse0 (_ bv4 32)) (_ bv536870911 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet48#1_45| (_ BitVec 8))) (= (select .cse4 (bvadd (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet48#1_45|))))))) [2023-12-24 13:47:58,343 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-12-24 13:47:58,343 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2023-12-24 13:47:58,343 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2023-12-24 13:47:58,343 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (let ((.cse4 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse5 (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) .cse5))) (.cse3 (select .cse0 (_ bv8 32))) (.cse2 (select .cse0 (_ bv12 32)))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (bvsle .cse1 (_ bv1 32)) (bvuge .cse2 (_ bv1073741823 32)) (bvsge .cse1 (_ bv1 32)) (bvuge .cse3 (_ bv536870911 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse5)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= .cse2 |ULTIMATE.start_updateVariables_#t~mem78#1|) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (bvule (select .cse0 (_ bv4 32)) (_ bv536870911 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet48#1_45| (_ BitVec 8))) (= (select .cse4 (bvadd (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet48#1_45|))))))) [2023-12-24 13:47:58,343 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-12-24 13:47:58,343 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (let ((.cse4 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse5 (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) .cse5))) (.cse3 (select .cse0 (_ bv8 32))) (.cse2 (select .cse0 (_ bv12 32)))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (bvsle .cse1 (_ bv1 32)) (bvuge .cse2 (_ bv1073741823 32)) (bvsge .cse1 (_ bv1 32)) (bvuge .cse3 (_ bv536870911 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (bvule .cse2 (_ bv2147483647 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse5)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (bvule (select .cse0 (_ bv4 32)) (_ bv536870911 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet48#1_45| (_ BitVec 8))) (= (select .cse4 (bvadd (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet48#1_45|))))))) [2023-12-24 13:47:58,344 INFO L899 garLoopResultBuilder]: For program point L72-1(line 72) no Hoare annotation was computed. [2023-12-24 13:47:58,344 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2023-12-24 13:47:58,344 INFO L899 garLoopResultBuilder]: For program point L39-2(line 39) no Hoare annotation was computed. [2023-12-24 13:47:58,344 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse4 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse5 (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) .cse5))) (.cse3 (select .cse0 (_ bv8 32))) (.cse2 (select .cse0 (_ bv12 32)))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (bvsle .cse1 (_ bv1 32)) (bvuge .cse2 (_ bv1073741823 32)) (bvsge .cse1 (_ bv1 32)) (bvuge .cse3 (_ bv536870911 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (bvule .cse2 (_ bv2147483647 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse5)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (bvule (select .cse0 (_ bv4 32)) (_ bv536870911 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet48#1_45| (_ BitVec 8))) (= (select .cse4 (bvadd (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet48#1_45|))))))) [2023-12-24 13:47:58,344 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-12-24 13:47:58,344 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-24 13:47:58,344 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 45) no Hoare annotation was computed. [2023-12-24 13:47:58,344 INFO L899 garLoopResultBuilder]: For program point L74-2(line 74) no Hoare annotation was computed. [2023-12-24 13:47:58,344 INFO L899 garLoopResultBuilder]: For program point L74-3(line 74) no Hoare annotation was computed. [2023-12-24 13:47:58,344 INFO L899 garLoopResultBuilder]: For program point L41-2(lines 41 45) no Hoare annotation was computed. [2023-12-24 13:47:58,344 INFO L899 garLoopResultBuilder]: For program point L74-5(line 74) no Hoare annotation was computed. [2023-12-24 13:47:58,344 INFO L899 garLoopResultBuilder]: For program point L74-7(line 74) no Hoare annotation was computed. [2023-12-24 13:47:58,344 INFO L895 garLoopResultBuilder]: At program point L74-8(line 74) the Hoare annotation is: (let ((.cse4 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse5 (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) .cse5))) (.cse3 (select .cse0 (_ bv8 32))) (.cse2 (select .cse0 (_ bv12 32)))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (bvsle .cse1 (_ bv1 32)) (bvuge .cse2 (_ bv1073741823 32)) (bvsge .cse1 (_ bv1 32)) (bvuge .cse3 (_ bv536870911 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (bvule .cse2 (_ bv2147483647 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse5)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (bvule (select .cse0 (_ bv4 32)) (_ bv536870911 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet48#1_45| (_ BitVec 8))) (= (select .cse4 (bvadd (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet48#1_45|))))))) [2023-12-24 13:47:58,344 INFO L899 garLoopResultBuilder]: For program point L74-9(line 74) no Hoare annotation was computed. [2023-12-24 13:47:58,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 13:47:58,345 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse4 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse5 (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) .cse5))) (.cse3 (select .cse0 (_ bv8 32))) (.cse2 (select .cse0 (_ bv12 32)))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (bvsle .cse1 (_ bv1 32)) (bvuge .cse2 (_ bv1073741823 32)) (bvsge .cse1 (_ bv1 32)) (bvuge .cse3 (_ bv536870911 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (bvule .cse2 (_ bv2147483647 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse5)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (bvule (select .cse0 (_ bv4 32)) (_ bv536870911 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet48#1_45| (_ BitVec 8))) (= (select .cse4 (bvadd (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet48#1_45|))))))) [2023-12-24 13:47:58,345 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-12-24 13:47:58,345 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-12-24 13:47:58,345 INFO L899 garLoopResultBuilder]: For program point L76-2(line 76) no Hoare annotation was computed. [2023-12-24 13:47:58,345 INFO L899 garLoopResultBuilder]: For program point L76-3(line 76) no Hoare annotation was computed. [2023-12-24 13:47:58,345 INFO L899 garLoopResultBuilder]: For program point L76-5(line 76) no Hoare annotation was computed. [2023-12-24 13:47:58,345 INFO L899 garLoopResultBuilder]: For program point L76-7(line 76) no Hoare annotation was computed. [2023-12-24 13:47:58,345 INFO L895 garLoopResultBuilder]: At program point L76-8(line 76) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse1 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) .cse2)))) (and (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse2)) (let ((.cse13 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|))) (let ((.cse9 (let ((.cse16 (let ((.cse17 (select |#memory_int#2| |~#double_Array_0~0.base|))) (concat (select .cse17 (bvadd |~#double_Array_0~0.offset| (_ bv12 32))) (select .cse17 (bvadd |~#double_Array_0~0.offset| (_ bv8 32))))))) (fp ((_ extract 63 63) .cse16) ((_ extract 62 52) .cse16) ((_ extract 51 0) .cse16)))) (.cse15 (select .cse13 (_ bv8 32))) (.cse14 (select .cse13 (_ bv12 32)))) (let ((.cse3 (bvuge (select .cse13 (_ bv0 32)) (_ bv2147483647 32))) (.cse4 (bvuge .cse14 (_ bv1073741823 32))) (.cse5 (bvuge .cse15 (_ bv536870911 32))) (.cse10 (fp.geq .cse9 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854776000.0))))) (.cse6 (bvule .cse15 (_ bv1073741823 32))) (.cse7 (bvule .cse14 (_ bv2147483647 32))) (.cse8 (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32))) (.cse11 (= currentRoundingMode roundNearestTiesToEven)) (.cse12 (bvule (select .cse13 (_ bv4 32)) (_ bv536870911 32)))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (fp.leq .cse9 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))))) .cse10 .cse11 .cse12) (and .cse3 .cse4 .cse5 (or (and |ULTIMATE.start_updateVariables_#t~short62#1| .cse10) (and (not |ULTIMATE.start_updateVariables_#t~short62#1|) (not .cse10))) .cse6 .cse7 .cse8 .cse11 .cse12))))) (= ((_ extract 7 0) (select .cse1 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet48#1_45| (_ BitVec 8))) (= (select .cse1 (bvadd (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet48#1_45|))))))) [2023-12-24 13:47:58,345 INFO L899 garLoopResultBuilder]: For program point L76-9(line 76) no Hoare annotation was computed. [2023-12-24 13:47:58,345 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2023-12-24 13:47:58,345 INFO L899 garLoopResultBuilder]: For program point L44-2(line 44) no Hoare annotation was computed. [2023-12-24 13:47:58,345 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (let ((.cse3 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse5 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse4 (select .cse3 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) .cse4))) (.cse2 (select .cse5 (_ bv8 32))) (.cse1 (select .cse5 (_ bv12 32)))) (and (bvsle .cse0 (_ bv1 32)) (bvuge .cse1 (_ bv1073741823 32)) (bvsge .cse0 (_ bv1 32)) (bvuge .cse2 (_ bv536870911 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (bvule .cse2 (_ bv1073741823 32)) (bvule .cse1 (_ bv2147483647 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse4)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= |ULTIMATE.start_updateVariables_#t~mem68#1| (select .cse5 (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse3 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet48#1_45| (_ BitVec 8))) (= (select .cse3 (bvadd (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet48#1_45|))))))) [2023-12-24 13:47:58,345 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (let ((.cse4 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse5 (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) .cse5))) (.cse3 (select .cse0 (_ bv8 32))) (.cse2 (select .cse0 (_ bv12 32)))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (bvsle .cse1 (_ bv1 32)) (bvuge .cse2 (_ bv1073741823 32)) (bvsge .cse1 (_ bv1 32)) (bvuge .cse3 (_ bv536870911 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (bvule .cse2 (_ bv2147483647 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse5)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet48#1_45| (_ BitVec 8))) (= (select .cse4 (bvadd (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet48#1_45|))))))) [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L79-1(line 79) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L96(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L96-2(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L96-3(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L96-4(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L96-6(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L96-7(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L96-9(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L96-10(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L96-11(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L96-12(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L96-13(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L96-15(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L96-17(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L47-2(line 47) no Hoare annotation was computed. [2023-12-24 13:47:58,346 INFO L899 garLoopResultBuilder]: For program point L96-19(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L96-21(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L96-23(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L96-25(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L96-26(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L96-27(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L96-28(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L96-30(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L96-32(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L96-34(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L96-35(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L96-36(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L96-38(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L96-40(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L96-41(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L96-43(line 96) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse4 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse5 (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) .cse5))) (.cse3 (select .cse0 (_ bv8 32))) (.cse2 (select .cse0 (_ bv12 32)))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (bvsle .cse1 (_ bv1 32)) (bvuge .cse2 (_ bv1073741823 32)) (bvsge .cse1 (_ bv1 32)) (bvuge .cse3 (_ bv536870911 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (bvule .cse2 (_ bv2147483647 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse5)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet48#1_45| (_ BitVec 8))) (= (select .cse4 (bvadd (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet48#1_45|))))))) [2023-12-24 13:47:58,347 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-12-24 13:47:58,347 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (let ((.cse5 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse4 (select .cse5 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) .cse4))) (.cse3 (select .cse0 (_ bv8 32))) (.cse2 (select .cse0 (_ bv12 32)))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (bvsle .cse1 (_ bv1 32)) (bvuge .cse2 (_ bv1073741823 32)) (bvsge .cse1 (_ bv1 32)) (bvuge .cse3 (_ bv536870911 32)) (bvule .cse3 (_ bv1073741823 32)) (bvule .cse2 (_ bv2147483647 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse4)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse5 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (bvule (select .cse0 (_ bv4 32)) (_ bv536870911 32)))))) [2023-12-24 13:47:58,348 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2023-12-24 13:47:58,348 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 13:47:58,348 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (let ((.cse4 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse5 (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) .cse5))) (.cse3 (select .cse0 (_ bv8 32))) (.cse2 (select .cse0 (_ bv12 32)))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (= (select .cse0 (_ bv4 32)) |ULTIMATE.start_updateVariables_#t~mem72#1|) (bvsle .cse1 (_ bv1 32)) (bvuge .cse2 (_ bv1073741823 32)) (bvsge .cse1 (_ bv1 32)) (bvuge .cse3 (_ bv536870911 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (bvule .cse2 (_ bv2147483647 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse5)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet48#1_45| (_ BitVec 8))) (= (select .cse4 (bvadd (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet48#1_45|))))))) [2023-12-24 13:47:58,348 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2023-12-24 13:47:58,348 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2023-12-24 13:47:58,348 INFO L899 garLoopResultBuilder]: For program point L49-2(lines 49 61) no Hoare annotation was computed. [2023-12-24 13:47:58,348 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse4 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse5 (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) .cse5))) (.cse3 (select .cse0 (_ bv8 32))) (.cse2 (select .cse0 (_ bv12 32)))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (bvsle .cse1 (_ bv1 32)) (bvuge .cse2 (_ bv1073741823 32)) (bvsge .cse1 (_ bv1 32)) (bvuge .cse3 (_ bv536870911 32)) (= ((_ extract 7 0) (select .cse4 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|))) |ULTIMATE.start_updateVariables_#t~mem44#1|) (bvule .cse3 (_ bv1073741823 32)) (bvule .cse2 (_ bv2147483647 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse5)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (bvule (select .cse0 (_ bv4 32)) (_ bv536870911 32)))))) [2023-12-24 13:47:58,348 INFO L899 garLoopResultBuilder]: For program point L66-1(line 66) no Hoare annotation was computed. [2023-12-24 13:47:58,348 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 58) no Hoare annotation was computed. [2023-12-24 13:47:58,348 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse3 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|)) (.cse4 (select .cse3 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) .cse4))) (.cse2 (select .cse0 (_ bv12 32)))) (and (= (select .cse0 (_ bv8 32)) |ULTIMATE.start_updateVariables_#t~mem74#1|) (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (bvsle .cse1 (_ bv1 32)) (bvuge .cse2 (_ bv1073741823 32)) (bvsge .cse1 (_ bv1 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (bvule .cse2 (_ bv2147483647 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse4)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse3 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (bvule (select .cse0 (_ bv4 32)) (_ bv536870911 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet48#1_45| (_ BitVec 8))) (= (select .cse3 (bvadd (_ bv4 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet48#1_45|))))))) [2023-12-24 13:47:58,348 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-12-24 13:47:58,348 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 57) no Hoare annotation was computed. [2023-12-24 13:47:58,349 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse3 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse0 (select |#memory_int#3| |~#unsigned_long_int_Array_0~0.base|))) (let ((.cse2 (select .cse0 (_ bv8 32))) (.cse1 (select .cse0 (_ bv12 32))) (.cse4 (select .cse3 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (and (bvuge (select .cse0 (_ bv0 32)) (_ bv2147483647 32)) (bvuge .cse1 (_ bv1073741823 32)) (bvuge .cse2 (_ bv536870911 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (= |ULTIMATE.start_updateVariables_#t~mem46#1| ((_ extract 7 0) .cse4)) (bvule .cse2 (_ bv1073741823 32)) (bvule .cse1 (_ bv2147483647 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet45#1_49| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet45#1_49|) .cse4)) (= |~#unsigned_long_int_Array_0~0.offset| (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= ((_ extract 7 0) (select .cse3 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv5 32)))) (_ bv0 8)) (bvule (select .cse0 (_ bv4 32)) (_ bv536870911 32))))) [2023-12-24 13:47:58,349 INFO L899 garLoopResultBuilder]: For program point L68-1(line 68) no Hoare annotation was computed. [2023-12-24 13:47:58,351 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, 1] [2023-12-24 13:47:58,354 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 13:47:58,361 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_long_int_Array_0~0!base][0bv32] could not be translated [2023-12-24 13:47:58,362 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#BOOL_unsigned_char_Array_0~0!offset)] could not be translated [2023-12-24 13:47:58,363 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_long_int_Array_0~0!base][12bv32] could not be translated [2023-12-24 13:47:58,363 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_long_int_Array_0~0!base][8bv32] could not be translated [2023-12-24 13:47:58,364 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_long_int_Array_0~0!base][8bv32] could not be translated [2023-12-24 13:47:58,364 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_long_int_Array_0~0!base][12bv32] could not be translated [2023-12-24 13:47:58,364 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#BOOL_unsigned_char_Array_0~0!offset)] could not be translated [2023-12-24 13:47:58,364 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, 5bv32)] could not be translated [2023-12-24 13:47:58,364 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet45#1_49 : bv8 :: (~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet45#1_49) == #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] && ~bvsge~32(~zero_extend~32~8(~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet45#1_49)[7:0]), 1bv32)) && ~bvsle~64(~zero_extend~32~8(~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet45#1_49)[7:0]), 1bv32)) could not be translated [2023-12-24 13:47:58,364 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 13:47:58,364 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_long_int_Array_0~0!base][4bv32] could not be translated [2023-12-24 13:47:58,364 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet48#1_45 : bv8 :: #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(4bv32, ~#BOOL_unsigned_char_Array_0~0!offset)] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet48#1_45)) could not be translated [2023-12-24 13:47:58,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:47:58 BoogieIcfgContainer [2023-12-24 13:47:58,365 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 13:47:58,365 INFO L158 Benchmark]: Toolchain (without parser) took 838667.41ms. Allocated memory was 309.3MB in the beginning and 864.0MB in the end (delta: 554.7MB). Free memory was 267.2MB in the beginning and 791.6MB in the end (delta: -524.3MB). Peak memory consumption was 522.3MB. Max. memory is 8.0GB. [2023-12-24 13:47:58,365 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 203.4MB. Free memory was 154.3MB in the beginning and 154.2MB in the end (delta: 89.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 13:47:58,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.60ms. Allocated memory is still 309.3MB. Free memory was 266.9MB in the beginning and 250.4MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-24 13:47:58,365 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.04ms. Allocated memory is still 309.3MB. Free memory was 250.4MB in the beginning and 246.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-24 13:47:58,365 INFO L158 Benchmark]: Boogie Preprocessor took 58.91ms. Allocated memory is still 309.3MB. Free memory was 246.6MB in the beginning and 240.7MB in the end (delta: 5.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 13:47:58,366 INFO L158 Benchmark]: RCFGBuilder took 1051.46ms. Allocated memory is still 309.3MB. Free memory was 240.7MB in the beginning and 256.7MB in the end (delta: -16.0MB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. [2023-12-24 13:47:58,366 INFO L158 Benchmark]: TraceAbstraction took 837220.39ms. Allocated memory was 309.3MB in the beginning and 864.0MB in the end (delta: 554.7MB). Free memory was 256.2MB in the beginning and 791.6MB in the end (delta: -535.4MB). Peak memory consumption was 510.1MB. Max. memory is 8.0GB. [2023-12-24 13:47:58,366 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.42ms. Allocated memory is still 203.4MB. Free memory was 154.3MB in the beginning and 154.2MB in the end (delta: 89.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 282.60ms. Allocated memory is still 309.3MB. Free memory was 266.9MB in the beginning and 250.4MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.04ms. Allocated memory is still 309.3MB. Free memory was 250.4MB in the beginning and 246.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.91ms. Allocated memory is still 309.3MB. Free memory was 246.6MB in the beginning and 240.7MB in the end (delta: 5.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1051.46ms. Allocated memory is still 309.3MB. Free memory was 240.7MB in the beginning and 256.7MB in the end (delta: -16.0MB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. * TraceAbstraction took 837220.39ms. Allocated memory was 309.3MB in the beginning and 864.0MB in the end (delta: 554.7MB). Free memory was 256.2MB in the beginning and 791.6MB in the end (delta: -535.4MB). Peak memory consumption was 510.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_long_int_Array_0~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#BOOL_unsigned_char_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_long_int_Array_0~0!base][12bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_long_int_Array_0~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_long_int_Array_0~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_long_int_Array_0~0!base][12bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#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, 5bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet45#1_49 : bv8 :: (~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet45#1_49) == #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] && ~bvsge~32(~zero_extend~32~8(~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet45#1_49)[7:0]), 1bv32)) && ~bvsle~64(~zero_extend~32~8(~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet45#1_49)[7:0]), 1bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_long_int_Array_0~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet48#1_45 : bv8 :: #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(4bv32, ~#BOOL_unsigned_char_Array_0~0!offset)] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet48#1_45)) could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 837.2s, OverallIterations: 29, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 215.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 327.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 3830 SdHoareTripleChecker+Valid, 164.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3772 mSDsluCounter, 19122 SdHoareTripleChecker+Invalid, 154.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4 IncrementalHoareTripleChecker+Unchecked, 15000 mSDsCounter, 360 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7124 IncrementalHoareTripleChecker+Invalid, 7489 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 360 mSolverCounterUnsat, 4122 mSDtfsCounter, 7124 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6398 GetRequests, 5957 SyntacticMatches, 5 SemanticMatches, 436 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 2639 ImplicationChecksByTransitivity, 135.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=605occurred in iteration=26, InterpolantAutomatonStates: 286, 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, 29 MinimizatonAttempts, 1198 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 835 PreInvPairs, 901 NumberOfFragments, 2344 HoareAnnotationTreeSize, 835 FormulaSimplifications, 20678742 FormulaSimplificationTreeSizeReduction, 175.4s HoareSimplificationTime, 20 FormulaSimplificationsInter, 13652526 FormulaSimplificationTreeSizeReductionInter, 151.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 40.7s SatisfiabilityAnalysisTime, 243.1s InterpolantComputationTime, 4629 NumberOfCodeBlocks, 4629 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 6079 ConstructedInterpolants, 500 QuantifiedInterpolants, 124914 SizeOfPredicates, 289 NumberOfNonLiveVariables, 10136 ConjunctsInSsa, 473 ConjunctsInUnsatCore, 42 InterpolantComputations, 23 PerfectInterpolantSequences, 24508/25704 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: 102]: Loop Invariant Derived loop invariant: ((null & 127) == 0) RESULT: Ultimate proved your program to be correct! [2023-12-24 13:47:58,596 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 13:47:58,637 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...