/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-42.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 15:29:08,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 15:29:08,103 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-16 15:29:08,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 15:29:08,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 15:29:08,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 15:29:08,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 15:29:08,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 15:29:08,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 15:29:08,132 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 15:29:08,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 15:29:08,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 15:29:08,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 15:29:08,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 15:29:08,133 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 15:29:08,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 15:29:08,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 15:29:08,134 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 15:29:08,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 15:29:08,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 15:29:08,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 15:29:08,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 15:29:08,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 15:29:08,138 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 15:29:08,138 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 15:29:08,139 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 15:29:08,139 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 15:29:08,139 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 15:29:08,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 15:29:08,139 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 15:29:08,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 15:29:08,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 15:29:08,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 15:29:08,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 15:29:08,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 15:29:08,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 15:29:08,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 15:29:08,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 15:29:08,141 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 15:29:08,141 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 15:29:08,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 15:29:08,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 15:29:08,142 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 15:29:08,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 15:29:08,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 15:29:08,142 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 15:29:08,142 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-16 15:29:08,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 15:29:08,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 15:29:08,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 15:29:08,335 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 15:29:08,335 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 15:29:08,336 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-42.i [2023-12-16 15:29:09,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 15:29:09,411 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 15:29:09,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2023-12-16 15:29:09,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/079f8d60f/563a534434b74407a71adb0dc2ba6f55/FLAGbfa8e3463 [2023-12-16 15:29:09,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/079f8d60f/563a534434b74407a71adb0dc2ba6f55 [2023-12-16 15:29:09,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 15:29:09,428 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 15:29:09,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 15:29:09,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 15:29:09,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 15:29:09,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:29:09" (1/1) ... [2023-12-16 15:29:09,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74dd86f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:29:09, skipping insertion in model container [2023-12-16 15:29:09,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:29:09" (1/1) ... [2023-12-16 15:29:09,454 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 15:29:09,549 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-42.i[916,929] [2023-12-16 15:29:09,588 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 15:29:09,598 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 15:29:09,615 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-42.i[916,929] [2023-12-16 15:29:09,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 15:29:09,689 INFO L206 MainTranslator]: Completed translation [2023-12-16 15:29:09,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:29:09 WrapperNode [2023-12-16 15:29:09,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 15:29:09,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 15:29:09,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 15:29:09,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 15:29:09,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:29:09" (1/1) ... [2023-12-16 15:29:09,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:29:09" (1/1) ... [2023-12-16 15:29:09,755 INFO L138 Inliner]: procedures = 33, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2023-12-16 15:29:09,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 15:29:09,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 15:29:09,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 15:29:09,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 15:29:09,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:29:09" (1/1) ... [2023-12-16 15:29:09,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:29:09" (1/1) ... [2023-12-16 15:29:09,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:29:09" (1/1) ... [2023-12-16 15:29:09,798 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 40, 21, 9, 43]. 37 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 6, 2, 1, 2]. The 15 writes are split as follows [0, 9, 2, 2, 2]. [2023-12-16 15:29:09,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:29:09" (1/1) ... [2023-12-16 15:29:09,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:29:09" (1/1) ... [2023-12-16 15:29:09,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:29:09" (1/1) ... [2023-12-16 15:29:09,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:29:09" (1/1) ... [2023-12-16 15:29:09,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:29:09" (1/1) ... [2023-12-16 15:29:09,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:29:09" (1/1) ... [2023-12-16 15:29:09,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 15:29:09,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 15:29:09,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 15:29:09,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 15:29:09,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:29:09" (1/1) ... [2023-12-16 15:29:09,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 15:29:09,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 15:29:09,868 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-16 15:29:09,892 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-16 15:29:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 15:29:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-16 15:29:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-16 15:29:09,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-16 15:29:09,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-16 15:29:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-16 15:29:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 15:29:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 15:29:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 15:29:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-16 15:29:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-16 15:29:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-16 15:29:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-16 15:29:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-16 15:29:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-16 15:29:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-16 15:29:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-12-16 15:29:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-12-16 15:29:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2023-12-16 15:29:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2023-12-16 15:29:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2023-12-16 15:29:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 15:29:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 15:29:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 15:29:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-16 15:29:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-16 15:29:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-12-16 15:29:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-12-16 15:29:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2023-12-16 15:29:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2023-12-16 15:29:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2023-12-16 15:29:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-12-16 15:29:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-12-16 15:29:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2023-12-16 15:29:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2023-12-16 15:29:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2023-12-16 15:29:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 15:29:09,905 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 15:29:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 15:29:09,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 15:29:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-16 15:29:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-16 15:29:09,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-16 15:29:09,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-16 15:29:09,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-16 15:29:09,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 15:29:09,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 15:29:09,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 15:29:09,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-16 15:29:09,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-16 15:29:10,022 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 15:29:10,024 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 15:29:10,482 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 15:29:10,516 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 15:29:10,516 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 15:29:10,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:29:10 BoogieIcfgContainer [2023-12-16 15:29:10,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 15:29:10,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 15:29:10,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 15:29:10,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 15:29:10,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:29:09" (1/3) ... [2023-12-16 15:29:10,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a52214c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:29:10, skipping insertion in model container [2023-12-16 15:29:10,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:29:09" (2/3) ... [2023-12-16 15:29:10,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a52214c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:29:10, skipping insertion in model container [2023-12-16 15:29:10,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:29:10" (3/3) ... [2023-12-16 15:29:10,522 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-42.i [2023-12-16 15:29:10,535 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 15:29:10,535 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 15:29:10,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 15:29:10,579 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;@280cce52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 15:29:10,579 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 15:29:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 15:29:10,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 15:29:10,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:29:10,595 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:29:10,596 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:29:10,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:29:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash 128850661, now seen corresponding path program 1 times [2023-12-16 15:29:10,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:29:10,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296313152] [2023-12-16 15:29:10,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:29:10,614 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-16 15:29:10,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:29:10,617 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-16 15:29:10,620 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-16 15:29:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:29:10,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 15:29:10,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:29:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-12-16 15:29:10,877 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:29:10,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:29:10,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296313152] [2023-12-16 15:29:10,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296313152] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:29:10,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:29:10,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 15:29:10,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869116263] [2023-12-16 15:29:10,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:29:10,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 15:29:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:29:10,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 15:29:10,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 15:29:10,915 INFO L87 Difference]: Start difference. First operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:29:10,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:29:10,960 INFO L93 Difference]: Finished difference Result 183 states and 283 transitions. [2023-12-16 15:29:10,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 15:29:10,963 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2023-12-16 15:29:10,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:29:10,969 INFO L225 Difference]: With dead ends: 183 [2023-12-16 15:29:10,969 INFO L226 Difference]: Without dead ends: 91 [2023-12-16 15:29:10,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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-16 15:29:10,976 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:29:10,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:29:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-16 15:29:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-12-16 15:29:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 15:29:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2023-12-16 15:29:11,019 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 98 [2023-12-16 15:29:11,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:29:11,019 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2023-12-16 15:29:11,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:29:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2023-12-16 15:29:11,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 15:29:11,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:29:11,027 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:29:11,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 15:29:11,232 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-16 15:29:11,232 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:29:11,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:29:11,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1294475227, now seen corresponding path program 1 times [2023-12-16 15:29:11,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:29:11,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831629019] [2023-12-16 15:29:11,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:29:11,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-16 15:29:11,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:29:11,236 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-16 15:29:11,241 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-16 15:29:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:29:11,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-16 15:29:11,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:29:11,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 33 treesize of output 28 [2023-12-16 15:29:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-16 15:29:11,627 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:29:11,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:29:11,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831629019] [2023-12-16 15:29:11,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831629019] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:29:11,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:29:11,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 15:29:11,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334272663] [2023-12-16 15:29:11,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:29:11,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 15:29:11,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:29:11,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 15:29:11,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-16 15:29:11,639 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:29:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:29:12,111 INFO L93 Difference]: Finished difference Result 219 states and 307 transitions. [2023-12-16 15:29:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 15:29:12,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2023-12-16 15:29:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:29:12,113 INFO L225 Difference]: With dead ends: 219 [2023-12-16 15:29:12,113 INFO L226 Difference]: Without dead ends: 129 [2023-12-16 15:29:12,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-12-16 15:29:12,114 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 229 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 15:29:12,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 519 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 15:29:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-16 15:29:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 95. [2023-12-16 15:29:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 15:29:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2023-12-16 15:29:12,128 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 98 [2023-12-16 15:29:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:29:12,130 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2023-12-16 15:29:12,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:29:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2023-12-16 15:29:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 15:29:12,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:29:12,132 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:29:12,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-16 15:29:12,340 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-16 15:29:12,341 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:29:12,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:29:12,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1160461721, now seen corresponding path program 1 times [2023-12-16 15:29:12,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:29:12,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590677865] [2023-12-16 15:29:12,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:29:12,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:29:12,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:29:12,343 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-16 15:29:12,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 15:29:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:29:12,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-16 15:29:12,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:29:12,538 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 28 [2023-12-16 15:29:12,609 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 30 treesize of output 26 [2023-12-16 15:29:12,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2023-12-16 15:29:12,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:29:12,818 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 114 treesize of output 52 [2023-12-16 15:29:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-16 15:29:12,826 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:29:12,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:29:12,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590677865] [2023-12-16 15:29:12,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590677865] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:29:12,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:29:12,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 15:29:12,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665870631] [2023-12-16 15:29:12,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:29:12,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 15:29:12,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:29:12,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 15:29:12,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-16 15:29:12,827 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:29:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:29:13,454 INFO L93 Difference]: Finished difference Result 331 states and 461 transitions. [2023-12-16 15:29:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 15:29:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2023-12-16 15:29:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:29:13,456 INFO L225 Difference]: With dead ends: 331 [2023-12-16 15:29:13,457 INFO L226 Difference]: Without dead ends: 237 [2023-12-16 15:29:13,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2023-12-16 15:29:13,458 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 626 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 15:29:13,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 646 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 15:29:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-12-16 15:29:13,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 112. [2023-12-16 15:29:13,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 15:29:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2023-12-16 15:29:13,469 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 98 [2023-12-16 15:29:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:29:13,469 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2023-12-16 15:29:13,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:29:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2023-12-16 15:29:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 15:29:13,470 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:29:13,470 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:29:13,480 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-16 15:29:13,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:29:13,675 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:29:13,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:29:13,675 INFO L85 PathProgramCache]: Analyzing trace with hash 573655707, now seen corresponding path program 1 times [2023-12-16 15:29:13,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:29:13,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892748202] [2023-12-16 15:29:13,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:29:13,676 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-16 15:29:13,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:29:13,678 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:29:13,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 15:29:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:29:13,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 15:29:13,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:29:13,866 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-16 15:29:13,902 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-16 15:29:13,934 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-16 15:29:13,965 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-16 15:29:14,063 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-16 15:29:14,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-12-16 15:29:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-16 15:29:14,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:29:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-16 15:29:14,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:29:14,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892748202] [2023-12-16 15:29:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892748202] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 15:29:14,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 15:29:14,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-16 15:29:14,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012730270] [2023-12-16 15:29:14,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 15:29:14,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 15:29:14,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:29:14,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 15:29:14,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-16 15:29:14,287 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 10 states, 8 states have (on average 7.0) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2023-12-16 15:29:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:29:14,527 INFO L93 Difference]: Finished difference Result 233 states and 322 transitions. [2023-12-16 15:29:14,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 15:29:14,528 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.0) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 98 [2023-12-16 15:29:14,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:29:14,529 INFO L225 Difference]: With dead ends: 233 [2023-12-16 15:29:14,529 INFO L226 Difference]: Without dead ends: 122 [2023-12-16 15:29:14,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2023-12-16 15:29:14,530 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 161 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:29:14,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 405 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 15:29:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-16 15:29:14,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2023-12-16 15:29:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 15:29:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 158 transitions. [2023-12-16 15:29:14,546 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 158 transitions. Word has length 98 [2023-12-16 15:29:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:29:14,546 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 158 transitions. [2023-12-16 15:29:14,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.0) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2023-12-16 15:29:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2023-12-16 15:29:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 15:29:14,547 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:29:14,547 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:29:14,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 15:29:14,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:29:14,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:29:14,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:29:14,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1711008172, now seen corresponding path program 1 times [2023-12-16 15:29:14,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:29:14,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710226415] [2023-12-16 15:29:14,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:29:14,753 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-16 15:29:14,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:29:14,754 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-16 15:29:14,788 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-16 15:29:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:29:14,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-16 15:29:14,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:29:14,930 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 28 [2023-12-16 15:29:14,993 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 30 treesize of output 26 [2023-12-16 15:29:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-16 15:29:15,094 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:29:15,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:29:15,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710226415] [2023-12-16 15:29:15,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710226415] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:29:15,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:29:15,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 15:29:15,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014478829] [2023-12-16 15:29:15,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:29:15,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 15:29:15,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:29:15,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 15:29:15,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-16 15:29:15,096 INFO L87 Difference]: Start difference. First operand 116 states and 158 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:29:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:29:15,716 INFO L93 Difference]: Finished difference Result 343 states and 460 transitions. [2023-12-16 15:29:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 15:29:15,717 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2023-12-16 15:29:15,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:29:15,718 INFO L225 Difference]: With dead ends: 343 [2023-12-16 15:29:15,718 INFO L226 Difference]: Without dead ends: 228 [2023-12-16 15:29:15,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2023-12-16 15:29:15,719 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 243 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 15:29:15,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 671 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 15:29:15,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-12-16 15:29:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 116. [2023-12-16 15:29:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 101 states have internal predecessors, (135), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 15:29:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2023-12-16 15:29:15,738 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 98 [2023-12-16 15:29:15,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:29:15,738 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2023-12-16 15:29:15,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:29:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2023-12-16 15:29:15,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 15:29:15,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:29:15,739 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:29:15,746 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-16 15:29:15,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:29:15,940 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:29:15,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:29:15,941 INFO L85 PathProgramCache]: Analyzing trace with hash -122660270, now seen corresponding path program 1 times [2023-12-16 15:29:15,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:29:15,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666815345] [2023-12-16 15:29:15,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:29:15,941 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-16 15:29:15,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:29:15,942 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:29:15,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 15:29:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:29:16,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 15:29:16,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:29:16,396 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 121 treesize of output 61 [2023-12-16 15:29:16,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:29:16,544 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 154 treesize of output 58 [2023-12-16 15:29:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-16 15:29:16,618 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:29:21,301 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_21| (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int#2| |c_~#float_Array_0~0.base|) (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (.cse0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_21|)))) (or (not (= |c_ULTIMATE.start_step_#t~ite7#1| .cse0)) (fp.gt (fp.neg .cse0) .cse1) (not (fp.leq .cse1 .cse0))))) is different from false [2023-12-16 15:29:25,922 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_21| (_ BitVec 32))) (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int#2| |c_~#float_Array_0~0.base|) (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (.cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_21|)))) (or (not (= .cse0 .cse1)) (fp.gt (fp.neg .cse1) .cse0) (not (fp.leq .cse0 .cse1))))) is different from false [2023-12-16 15:29:26,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:29:26,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666815345] [2023-12-16 15:29:26,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666815345] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:29:26,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1359819147] [2023-12-16 15:29:26,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:29:26,167 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 15:29:26,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 15:29:26,201 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 15:29:26,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-16 15:29:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:29:26,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 15:29:26,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:29:30,111 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 121 treesize of output 61 [2023-12-16 15:29:30,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:29:30,972 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 154 treesize of output 58 [2023-12-16 15:29:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-16 15:29:31,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:29:36,558 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_24| (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int#2| |c_~#float_Array_0~0.base|) (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (.cse0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_24|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_24|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_24|)))) (or (fp.gt (fp.neg .cse0) .cse1) (not (fp.leq .cse1 .cse0)) (not (= |c_ULTIMATE.start_step_#t~ite7#1| .cse0))))) is different from false [2023-12-16 15:29:41,325 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_24| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_24|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_24|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_24|))) (.cse1 (let ((.cse2 (select (select |c_#memory_int#2| |c_~#float_Array_0~0.base|) (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (or (fp.gt (fp.neg .cse0) .cse1) (not (fp.leq .cse1 .cse0)) (not (= .cse0 .cse1))))) is different from false [2023-12-16 15:29:41,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1359819147] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:29:41,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 15:29:41,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-12-16 15:29:41,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36380655] [2023-12-16 15:29:41,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 15:29:41,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 15:29:41,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:29:41,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 15:29:41,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=173, Unknown=4, NotChecked=116, Total=342 [2023-12-16 15:29:41,643 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:29:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:29:55,486 INFO L93 Difference]: Finished difference Result 440 states and 597 transitions. [2023-12-16 15:29:55,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 15:29:55,487 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2023-12-16 15:29:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:29:55,488 INFO L225 Difference]: With dead ends: 440 [2023-12-16 15:29:55,488 INFO L226 Difference]: Without dead ends: 325 [2023-12-16 15:29:55,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=111, Invalid=407, Unknown=4, NotChecked=180, Total=702 [2023-12-16 15:29:55,489 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 407 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-12-16 15:29:55,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1287 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2023-12-16 15:29:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-16 15:29:55,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 315. [2023-12-16 15:29:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 276 states have (on average 1.3297101449275361) internal successors, (367), 278 states have internal predecessors, (367), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 15:29:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 427 transitions. [2023-12-16 15:29:55,508 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 427 transitions. Word has length 98 [2023-12-16 15:29:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:29:55,509 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 427 transitions. [2023-12-16 15:29:55,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:29:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 427 transitions. [2023-12-16 15:29:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 15:29:55,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:29:55,510 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:29:55,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 15:29:55,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2023-12-16 15:29:55,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 15:29:55,914 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:29:55,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:29:55,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1800567764, now seen corresponding path program 1 times [2023-12-16 15:29:55,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:29:55,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326598411] [2023-12-16 15:29:55,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:29:55,915 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-16 15:29:55,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:29:55,929 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-16 15:29:55,929 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-16 15:29:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:29:56,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:29:56,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:30:02,772 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 88 treesize of output 34 [2023-12-16 15:30:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-16 15:30:03,370 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:30:03,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:30:03,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326598411] [2023-12-16 15:30:03,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326598411] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:30:03,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:30:03,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 15:30:03,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120013690] [2023-12-16 15:30:03,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:30:03,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 15:30:03,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:30:03,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 15:30:03,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 15:30:03,372 INFO L87 Difference]: Start difference. First operand 315 states and 427 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:30:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:30:11,848 INFO L93 Difference]: Finished difference Result 544 states and 732 transitions. [2023-12-16 15:30:11,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 15:30:11,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2023-12-16 15:30:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:30:11,851 INFO L225 Difference]: With dead ends: 544 [2023-12-16 15:30:11,851 INFO L226 Difference]: Without dead ends: 230 [2023-12-16 15:30:11,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-16 15:30:11,853 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 207 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:30:11,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 603 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-12-16 15:30:11,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-12-16 15:30:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2023-12-16 15:30:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 193 states have (on average 1.310880829015544) internal successors, (253), 194 states have internal predecessors, (253), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 15:30:11,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 297 transitions. [2023-12-16 15:30:11,876 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 297 transitions. Word has length 98 [2023-12-16 15:30:11,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:30:11,876 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 297 transitions. [2023-12-16 15:30:11,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:30:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 297 transitions. [2023-12-16 15:30:11,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 15:30:11,877 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:30:11,877 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:30:11,883 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-16 15:30:12,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:30:12,077 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:30:12,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:30:12,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1816501776, now seen corresponding path program 1 times [2023-12-16 15:30:12,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:30:12,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438077080] [2023-12-16 15:30:12,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:30:12,078 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-16 15:30:12,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:30:12,079 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:30:12,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 15:30:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:30:12,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 15:30:12,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:30:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-16 15:30:12,502 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:30:12,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:30:12,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438077080] [2023-12-16 15:30:12,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438077080] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:30:12,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:30:12,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 15:30:12,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744428587] [2023-12-16 15:30:12,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:30:12,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 15:30:12,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:30:12,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 15:30:12,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 15:30:12,503 INFO L87 Difference]: Start difference. First operand 223 states and 297 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:30:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:30:13,178 INFO L93 Difference]: Finished difference Result 449 states and 599 transitions. [2023-12-16 15:30:13,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:30:13,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2023-12-16 15:30:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:30:13,181 INFO L225 Difference]: With dead ends: 449 [2023-12-16 15:30:13,181 INFO L226 Difference]: Without dead ends: 227 [2023-12-16 15:30:13,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:30:13,182 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 7 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 369 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.5s IncrementalHoareTripleChecker+Time [2023-12-16 15:30:13,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 369 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 15:30:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-12-16 15:30:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2023-12-16 15:30:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 193 states have (on average 1.305699481865285) internal successors, (252), 194 states have internal predecessors, (252), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 15:30:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 296 transitions. [2023-12-16 15:30:13,201 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 296 transitions. Word has length 98 [2023-12-16 15:30:13,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:30:13,202 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 296 transitions. [2023-12-16 15:30:13,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:30:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 296 transitions. [2023-12-16 15:30:13,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 15:30:13,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:30:13,204 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:30:13,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 15:30:13,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:30:13,409 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:30:13,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:30:13,409 INFO L85 PathProgramCache]: Analyzing trace with hash 590632511, now seen corresponding path program 1 times [2023-12-16 15:30:13,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:30:13,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225544607] [2023-12-16 15:30:13,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:30:13,410 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-16 15:30:13,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:30:13,410 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-16 15:30:13,411 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-16 15:30:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:30:13,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 15:30:13,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:30:13,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-16 15:30:15,451 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 41 treesize of output 32 [2023-12-16 15:30:18,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:30:18,608 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 74 treesize of output 44 [2023-12-16 15:30:19,336 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-16 15:30:19,337 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:30:19,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:30:19,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225544607] [2023-12-16 15:30:19,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225544607] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:30:19,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:30:19,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 15:30:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140837457] [2023-12-16 15:30:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:30:19,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 15:30:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:30:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 15:30:19,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-16 15:30:19,341 INFO L87 Difference]: Start difference. First operand 223 states and 296 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Received shutdown request... [2023-12-16 15:30:25,846 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 15:30:25,854 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 15:30:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 15:30:25,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-12-16 15:30:25,966 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 92 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:30:25,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 247 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-12-16 15:30:25,967 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 15:30:25,972 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-16 15:30:26,172 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-16 15:30:26,173 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (223states) and FLOYD_HOARE automaton (currently 13 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (91 states constructed, input type IntersectNwa). [2023-12-16 15:30:26,176 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:30:26,177 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 15:30:26,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:30:26 BoogieIcfgContainer [2023-12-16 15:30:26,178 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 15:30:26,179 INFO L158 Benchmark]: Toolchain (without parser) took 76750.40ms. Allocated memory was 194.0MB in the beginning and 378.5MB in the end (delta: 184.5MB). Free memory was 144.2MB in the beginning and 253.1MB in the end (delta: -108.9MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. [2023-12-16 15:30:26,179 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 194.0MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 15:30:26,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.02ms. Allocated memory is still 194.0MB. Free memory was 143.9MB in the beginning and 128.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 15:30:26,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.33ms. Allocated memory is still 194.0MB. Free memory was 128.2MB in the beginning and 124.7MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 15:30:26,179 INFO L158 Benchmark]: Boogie Preprocessor took 80.76ms. Allocated memory is still 194.0MB. Free memory was 124.7MB in the beginning and 119.8MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 15:30:26,179 INFO L158 Benchmark]: RCFGBuilder took 679.84ms. Allocated memory was 194.0MB in the beginning and 288.4MB in the end (delta: 94.4MB). Free memory was 119.4MB in the beginning and 229.9MB in the end (delta: -110.5MB). Peak memory consumption was 21.6MB. Max. memory is 8.0GB. [2023-12-16 15:30:26,180 INFO L158 Benchmark]: TraceAbstraction took 75660.02ms. Allocated memory was 288.4MB in the beginning and 378.5MB in the end (delta: 90.2MB). Free memory was 229.4MB in the beginning and 253.1MB in the end (delta: -23.7MB). Peak memory consumption was 66.1MB. Max. memory is 8.0GB. [2023-12-16 15:30:26,180 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 194.0MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.02ms. Allocated memory is still 194.0MB. Free memory was 143.9MB in the beginning and 128.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.33ms. Allocated memory is still 194.0MB. Free memory was 128.2MB in the beginning and 124.7MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.76ms. Allocated memory is still 194.0MB. Free memory was 124.7MB in the beginning and 119.8MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 679.84ms. Allocated memory was 194.0MB in the beginning and 288.4MB in the end (delta: 94.4MB). Free memory was 119.4MB in the beginning and 229.9MB in the end (delta: -110.5MB). Peak memory consumption was 21.6MB. Max. memory is 8.0GB. * TraceAbstraction took 75660.02ms. Allocated memory was 288.4MB in the beginning and 378.5MB in the end (delta: 90.2MB). Free memory was 229.4MB in the beginning and 253.1MB in the end (delta: -23.7MB). Peak memory consumption was 66.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was constructing difference of abstraction (223states) and FLOYD_HOARE automaton (currently 13 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (91 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 75.6s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2062 SdHoareTripleChecker+Valid, 24.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1972 mSDsluCounter, 4873 SdHoareTripleChecker+Invalid, 23.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3814 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2496 IncrementalHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 1059 mSDtfsCounter, 2496 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1181 GetRequests, 1062 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 30.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=315occurred in iteration=6, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 298 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 39.7s InterpolantComputationTime, 982 NumberOfCodeBlocks, 982 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1069 ConstructedInterpolants, 35 QuantifiedInterpolants, 10749 SizeOfPredicates, 82 NumberOfNonLiveVariables, 2284 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 2174/2420 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown