/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver bitwuzla -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/floats-cbmc-regression/float22.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 13:43:38,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 13:43:38,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 13:43:38,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 13:43:38,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 13:43:38,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 13:43:38,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 13:43:38,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 13:43:38,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 13:43:38,873 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 13:43:38,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 13:43:38,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 13:43:38,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 13:43:38,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 13:43:38,874 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 13:43:38,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 13:43:38,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 13:43:38,875 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 13:43:38,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 13:43:38,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 13:43:38,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 13:43:38,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 13:43:38,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 13:43:38,877 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 13:43:38,877 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 13:43:38,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 13:43:38,878 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 13:43:38,878 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 13:43:38,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 13:43:38,878 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 13:43:38,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 13:43:38,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 13:43:38,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 13:43:38,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 13:43:38,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 13:43:38,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 13:43:38,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 13:43:38,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 13:43:38,880 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 13:43:38,880 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 13:43:38,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 13:43:38,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 13:43:38,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 13:43:38,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 13:43:38,881 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> bitwuzla [2024-11-03 13:43:39,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 13:43:39,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 13:43:39,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 13:43:39,078 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 13:43:39,081 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 13:43:39,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-cbmc-regression/float22.i [2024-11-03 13:43:40,329 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 13:43:40,475 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 13:43:40,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float22.i [2024-11-03 13:43:40,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e2a50a0/35fb9d15c7fe448492abd69c796a069c/FLAG7af78cab7 [2024-11-03 13:43:40,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e2a50a0/35fb9d15c7fe448492abd69c796a069c [2024-11-03 13:43:40,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 13:43:40,896 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 13:43:40,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 13:43:40,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 13:43:40,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 13:43:40,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:43:40" (1/1) ... [2024-11-03 13:43:40,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c9d0b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:40, skipping insertion in model container [2024-11-03 13:43:40,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:43:40" (1/1) ... [2024-11-03 13:43:40,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 13:43:41,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float22.i[2558,2571] [2024-11-03 13:43:41,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float22.i[2753,2766] [2024-11-03 13:43:41,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float22.i[2881,2894] [2024-11-03 13:43:41,122 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float22.i[3073,3086] [2024-11-03 13:43:41,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 13:43:41,136 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 13:43:41,159 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float22.i[2558,2571] [2024-11-03 13:43:41,161 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float22.i[2753,2766] [2024-11-03 13:43:41,162 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float22.i[2881,2894] [2024-11-03 13:43:41,163 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float22.i[3073,3086] [2024-11-03 13:43:41,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 13:43:41,176 INFO L204 MainTranslator]: Completed translation [2024-11-03 13:43:41,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:41 WrapperNode [2024-11-03 13:43:41,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 13:43:41,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 13:43:41,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 13:43:41,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 13:43:41,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:41" (1/1) ... [2024-11-03 13:43:41,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:41" (1/1) ... [2024-11-03 13:43:41,206 INFO L138 Inliner]: procedures = 24, calls = 80, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 121 [2024-11-03 13:43:41,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 13:43:41,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 13:43:41,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 13:43:41,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 13:43:41,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:41" (1/1) ... [2024-11-03 13:43:41,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:41" (1/1) ... [2024-11-03 13:43:41,221 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:41" (1/1) ... [2024-11-03 13:43:41,232 INFO L175 MemorySlicer]: Split 41 memory accesses to 9 slices as follows [2, 7, 4, 2, 2, 5, 5, 7, 7]. 17 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0, 0]. The 26 writes are split as follows [0, 3, 3, 1, 1, 4, 4, 5, 5]. [2024-11-03 13:43:41,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:41" (1/1) ... [2024-11-03 13:43:41,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:41" (1/1) ... [2024-11-03 13:43:41,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:41" (1/1) ... [2024-11-03 13:43:41,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:41" (1/1) ... [2024-11-03 13:43:41,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:41" (1/1) ... [2024-11-03 13:43:41,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:41" (1/1) ... [2024-11-03 13:43:41,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 13:43:41,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 13:43:41,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 13:43:41,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 13:43:41,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:41" (1/1) ... [2024-11-03 13:43:41,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 13:43:41,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 13:43:41,278 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) [2024-11-03 13:43:41,280 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 [2024-11-03 13:43:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 13:43:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure returnsStructure [2024-11-03 13:43:41,298 INFO L138 BoogieDeclarations]: Found implementation of procedure returnsStructure [2024-11-03 13:43:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 13:43:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-03 13:43:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-03 13:43:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-03 13:43:41,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-03 13:43:41,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-03 13:43:41,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-03 13:43:41,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-03 13:43:41,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-03 13:43:41,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-03 13:43:41,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-03 13:43:41,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-03 13:43:41,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-03 13:43:41,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-03 13:43:41,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-03 13:43:41,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-03 13:43:41,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-03 13:43:41,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-03 13:43:41,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-03 13:43:41,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-03 13:43:41,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-03 13:43:41,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-03 13:43:41,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-03 13:43:41,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-03 13:43:41,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-03 13:43:41,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-03 13:43:41,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-03 13:43:41,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-03 13:43:41,304 INFO L130 BoogieDeclarations]: Found specification of procedure returnsField [2024-11-03 13:43:41,304 INFO L138 BoogieDeclarations]: Found implementation of procedure returnsField [2024-11-03 13:43:41,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 13:43:41,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 13:43:41,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-03 13:43:41,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-03 13:43:41,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-03 13:43:41,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-03 13:43:41,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-03 13:43:41,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-03 13:43:41,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-03 13:43:41,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-03 13:43:41,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-03 13:43:41,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-03 13:43:41,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-03 13:43:41,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-03 13:43:41,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-03 13:43:41,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-03 13:43:41,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-03 13:43:41,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-03 13:43:41,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-03 13:43:41,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-03 13:43:41,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-03 13:43:41,430 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 13:43:41,432 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 13:43:41,618 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-03 13:43:41,618 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 13:43:41,633 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 13:43:41,633 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-03 13:43:41,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:43:41 BoogieIcfgContainer [2024-11-03 13:43:41,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 13:43:41,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 13:43:41,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 13:43:41,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 13:43:41,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:43:40" (1/3) ... [2024-11-03 13:43:41,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a152cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:43:41, skipping insertion in model container [2024-11-03 13:43:41,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:41" (2/3) ... [2024-11-03 13:43:41,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a152cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:43:41, skipping insertion in model container [2024-11-03 13:43:41,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:43:41" (3/3) ... [2024-11-03 13:43:41,640 INFO L112 eAbstractionObserver]: Analyzing ICFG float22.i [2024-11-03 13:43:41,651 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 13:43:41,652 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-03 13:43:41,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 13:43:41,692 INFO L333 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, 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;@4a7a6be4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 13:43:41,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-03 13:43:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 13:43:41,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-03 13:43:41,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 13:43:41,700 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 13:43:41,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-03 13:43:41,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 13:43:41,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1770095910, now seen corresponding path program 1 times [2024-11-03 13:43:41,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 13:43:41,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1375025990] [2024-11-03 13:43:41,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 13:43:41,711 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 13:43:41,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:43:41,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 13:43:41,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Waiting until timeout for monitored process [2024-11-03 13:43:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 13:43:41,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-03 13:43:41,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 13:43:41,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2024-11-03 13:43:42,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-03 13:43:42,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-03 13:43:42,213 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_returnsStructure_~#c~1.base_8| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#1| |v_returnsStructure_~#c~1.base_8|))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_8| (store (store (store (select |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_8|) (_ bv0 32) (bvand (_ bv1 32) (bvand (_ bv1 32) |c_returnsStructure_#in~index|))) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))) (= (select .cse0 (_ bv4 32)) |c_returnsStructure_#res.ieee.exponent|) (= (let ((.cse1 (select .cse0 (_ bv0 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) |c_returnsStructure_#res.f|) (= |c_returnsStructure_#res.ieee.mantissa| (select .cse0 (_ bv8 32)))))) (exists ((|v_ULTIMATE.start_testOne_~#f1~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (let ((.cse3 (select |c_#memory_int#6| |v_ULTIMATE.start_testOne_~#f1~0#1.base_BEFORE_CALL_1|))) (and (= (fp (_ bv0 1) (_ bv0 8) (_ bv0 23)) (let ((.cse2 (select .cse3 (_ bv0 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (= (_ bv0 32) (select .cse3 (_ bv8 32))) (= (select .cse3 (_ bv4 32)) (_ bv0 32)))))) is different from true [2024-11-03 13:43:42,436 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-03 13:43:42,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 40 [2024-11-03 13:43:42,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-03 13:43:42,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-03 13:43:42,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-03 13:43:42,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 22 [2024-11-03 13:43:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-03 13:43:42,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 13:43:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-03 13:43:42,908 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 13:43:42,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1375025990] [2024-11-03 13:43:42,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1375025990] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 13:43:42,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 13:43:42,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-11-03 13:43:42,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447912757] [2024-11-03 13:43:42,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 13:43:42,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-03 13:43:42,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 13:43:42,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-03 13:43:42,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=174, Unknown=1, NotChecked=26, Total=240 [2024-11-03 13:43:42,945 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 16 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-03 13:43:47,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:43:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 13:43:47,259 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2024-11-03 13:43:47,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-03 13:43:47,264 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 14 [2024-11-03 13:43:47,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 13:43:47,269 INFO L225 Difference]: With dead ends: 85 [2024-11-03 13:43:47,269 INFO L226 Difference]: Without dead ends: 42 [2024-11-03 13:43:47,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=227, Unknown=1, NotChecked=30, Total=306 [2024-11-03 13:43:47,276 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-03 13:43:47,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 369 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 1 Unknown, 49 Unchecked, 4.2s Time] [2024-11-03 13:43:47,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-03 13:43:47,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-03 13:43:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 29 states have internal predecessors, (29), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 13:43:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-11-03 13:43:47,309 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2024-11-03 13:43:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 13:43:47,311 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-11-03 13:43:47,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-03 13:43:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-11-03 13:43:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-03 13:43:47,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 13:43:47,312 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 13:43:47,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Ended with exit code 0 [2024-11-03 13:43:47,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:43:47,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-03 13:43:47,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 13:43:47,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1024353009, now seen corresponding path program 1 times [2024-11-03 13:43:47,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 13:43:47,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [551025340] [2024-11-03 13:43:47,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 13:43:47,517 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 13:43:47,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:43:47,522 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 13:43:47,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Waiting until timeout for monitored process [2024-11-03 13:43:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 13:43:47,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-03 13:43:47,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 13:43:47,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2024-11-03 13:43:47,729 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_returnsStructure_~#c~1.base_28| (_ BitVec 32))) (= (store |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_28| (store (store (store (select |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_28|) (_ bv0 32) (bvand (_ bv1 32) (bvand (_ bv1 32) |c_returnsStructure_#in~index|))) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |c_#memory_int#1|)) is different from true [2024-11-03 13:43:47,774 INFO L349 Elim1Store]: treesize reduction 44, result has 37.1 percent of original size [2024-11-03 13:43:47,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 56 [2024-11-03 13:43:47,916 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_returnsStructure_~#c~1.base_29| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#1| |v_returnsStructure_~#c~1.base_29|))) (and (= |c_returnsStructure_#res.ieee.exponent| (select .cse0 (_ bv4 32))) (= |c_returnsStructure_#res.ieee.mantissa| (select .cse0 (_ bv8 32))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_29| (store (store (store (select |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_29|) (_ bv0 32) (bvand (_ bv1 32) (bvand (_ bv1 32) |c_returnsStructure_#in~index|))) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))) (= |c_returnsStructure_#res.f| (let ((.cse1 (select .cse0 (_ bv0 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))))) is different from true [2024-11-03 13:43:47,992 INFO L349 Elim1Store]: treesize reduction 44, result has 37.1 percent of original size [2024-11-03 13:43:47,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 56 [2024-11-03 13:43:48,270 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-03 13:43:48,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-03 13:43:48,484 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_testTwo_~#f1~1#1.base_BEFORE_CALL_1| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#7| |v_ULTIMATE.start_testTwo_~#f1~1#1.base_BEFORE_CALL_1|))) (and (= (_ bv0 32) (select .cse0 (_ bv4 32))) (= (fp (_ bv0 1) (_ bv0 8) (_ bv0 23)) (let ((.cse1 (select .cse0 (_ bv0 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (_ bv0 32) (select .cse0 (_ bv8 32)))))) (exists ((|v_returnsStructure_~#c~1.base_30| (_ BitVec 32))) (let ((.cse2 (select |c_#memory_int#1| |v_returnsStructure_~#c~1.base_30|))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_30| (store (store (store (select |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_30|) (_ bv0 32) (bvand (_ bv1 32) (bvand (_ bv1 32) |c_returnsStructure_#in~index|))) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))) (= |c_returnsStructure_#res.ieee.exponent| (select .cse2 (_ bv4 32))) (= |c_returnsStructure_#res.f| (let ((.cse3 (select .cse2 (_ bv0 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (= |c_returnsStructure_#res.ieee.mantissa| (select .cse2 (_ bv8 32))))))) is different from true [2024-11-03 13:43:48,675 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-03 13:43:48,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 40 [2024-11-03 13:43:48,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-03 13:43:48,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-03 13:43:48,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-03 13:43:48,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 22 [2024-11-03 13:43:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2024-11-03 13:43:48,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 13:43:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-03 13:43:49,259 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 13:43:49,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [551025340] [2024-11-03 13:43:49,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [551025340] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 13:43:49,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 13:43:49,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2024-11-03 13:43:49,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000353421] [2024-11-03 13:43:49,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 13:43:49,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-03 13:43:49,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 13:43:49,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-03 13:43:49,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=267, Unknown=3, NotChecked=102, Total=420 [2024-11-03 13:43:49,262 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 21 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 15 states have internal predecessors, (33), 5 states have call successors, (7), 3 states have call predecessors, (7), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-03 13:43:53,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-03 13:43:57,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-03 13:44:01,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-03 13:44:05,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-03 13:44:14,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:44:18,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:44:22,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:44:26,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:44:30,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:44:34,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:44:38,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:44:42,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:44:46,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:44:50,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:44:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 13:44:51,030 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-11-03 13:44:51,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-03 13:44:51,030 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 15 states have internal predecessors, (33), 5 states have call successors, (7), 3 states have call predecessors, (7), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 27 [2024-11-03 13:44:51,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 13:44:51,031 INFO L225 Difference]: With dead ends: 45 [2024-11-03 13:44:51,031 INFO L226 Difference]: Without dead ends: 43 [2024-11-03 13:44:51,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=107, Invalid=657, Unknown=4, NotChecked=162, Total=930 [2024-11-03 13:44:51,033 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 25 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 21 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 57.1s IncrementalHoareTripleChecker+Time [2024-11-03 13:44:51,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 278 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 282 Invalid, 14 Unknown, 121 Unchecked, 57.1s Time] [2024-11-03 13:44:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-03 13:44:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-11-03 13:44:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 13:44:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2024-11-03 13:44:51,040 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 27 [2024-11-03 13:44:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 13:44:51,040 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2024-11-03 13:44:51,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 15 states have internal predecessors, (33), 5 states have call successors, (7), 3 states have call predecessors, (7), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-03 13:44:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-03 13:44:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-03 13:44:51,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 13:44:51,041 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 13:44:51,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Forceful destruction successful, exit code 0 [2024-11-03 13:44:51,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:44:51,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-03 13:44:51,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 13:44:51,243 INFO L85 PathProgramCache]: Analyzing trace with hash 529159251, now seen corresponding path program 1 times [2024-11-03 13:44:51,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 13:44:51,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1715445463] [2024-11-03 13:44:51,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 13:44:51,244 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 13:44:51,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:44:51,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 13:44:51,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Waiting until timeout for monitored process [2024-11-03 13:44:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 13:44:51,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-03 13:44:51,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 13:44:51,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2024-11-03 13:44:51,422 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_returnsStructure_~#c~1.base_62| (_ BitVec 32))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_62| (store (store (store (select |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_62|) (_ bv0 32) (bvand (_ bv1 32) (bvand (_ bv1 32) |c_returnsStructure_#in~index|))) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))))) is different from true [2024-11-03 13:44:51,459 INFO L349 Elim1Store]: treesize reduction 44, result has 37.1 percent of original size [2024-11-03 13:44:51,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 56 [2024-11-03 13:44:51,563 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_returnsStructure_~#c~1.base_63| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#1| |v_returnsStructure_~#c~1.base_63|))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_63| (store (store (store (select |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_63|) (_ bv0 32) (bvand (_ bv1 32) (bvand (_ bv1 32) |c_returnsStructure_#in~index|))) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))) (= (select .cse0 (_ bv8 32)) |c_returnsStructure_#res.ieee.mantissa|) (= |c_returnsStructure_#res.ieee.exponent| (select .cse0 (_ bv4 32)))))) is different from true [2024-11-03 13:44:51,619 INFO L349 Elim1Store]: treesize reduction 44, result has 37.1 percent of original size [2024-11-03 13:44:51,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 56 [2024-11-03 13:44:51,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-03 13:44:51,927 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_returnsStructure_~#c~1.base_64| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#1| |v_returnsStructure_~#c~1.base_64|))) (and (= (select .cse0 (_ bv4 32)) |c_returnsStructure_#res.ieee.exponent|) (= |c_returnsStructure_#res.ieee.mantissa| (select .cse0 (_ bv8 32))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_64| (store (store (store (select |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_64|) (_ bv0 32) (bvand (_ bv1 32) (bvand (_ bv1 32) |c_returnsStructure_#in~index|))) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))))))) (exists ((|v_ULTIMATE.start_testTwo_~#f1~1#1.base_BEFORE_CALL_3| (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int#7| |v_ULTIMATE.start_testTwo_~#f1~1#1.base_BEFORE_CALL_3|))) (and (= (_ bv0 32) (select .cse1 (_ bv4 32))) (= (_ bv0 32) (select .cse1 (_ bv8 32))))))) is different from true [2024-11-03 13:44:52,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-03 13:44:52,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2024-11-03 13:44:52,549 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-03 13:44:52,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 58 treesize of output 61 [2024-11-03 13:44:59,735 INFO L349 Elim1Store]: treesize reduction 104, result has 1.0 percent of original size [2024-11-03 13:44:59,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 3 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 112 treesize of output 52 [2024-11-03 13:44:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2024-11-03 13:44:59,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 13:45:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-03 13:45:00,416 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 13:45:00,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1715445463] [2024-11-03 13:45:00,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1715445463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 13:45:00,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 13:45:00,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 8] total 29 [2024-11-03 13:45:00,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011856681] [2024-11-03 13:45:00,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 13:45:00,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-03 13:45:00,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 13:45:00,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-03 13:45:00,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=578, Unknown=5, NotChecked=150, Total=812 [2024-11-03 13:45:00,419 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 29 states, 25 states have (on average 1.72) internal successors, (43), 19 states have internal predecessors, (43), 7 states have call successors, (11), 5 states have call predecessors, (11), 9 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-03 13:45:04,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:45:08,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:45:12,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:45:12,499 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (bvand (_ bv1 32) (bvand (_ bv1 32) |c_returnsStructure_#in~index|)))) (and (exists ((|v_returnsStructure_~#c~1.base_61| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#1| |v_returnsStructure_~#c~1.base_61|))) (and (= (_ bv0 32) (select .cse0 (_ bv4 32))) (= (select .cse0 (_ bv0 32)) .cse1) (= (_ bv0 32) (select .cse0 (_ bv8 32)))))) (exists ((|v_returnsStructure_~#c~1.base_63| (_ BitVec 32))) (let ((.cse2 (select |c_#memory_int#1| |v_returnsStructure_~#c~1.base_63|))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_63| (store (store (store (select |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_63|) (_ bv0 32) .cse1) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))) (= (select .cse2 (_ bv8 32)) |c_returnsStructure_#res.ieee.mantissa|) (= |c_returnsStructure_#res.ieee.exponent| (select .cse2 (_ bv4 32)))))) (exists ((|v_returnsStructure_~#c~1.base_62| (_ BitVec 32))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_62| (store (store (store (select |c_old(#memory_int#1)| |v_returnsStructure_~#c~1.base_62|) (_ bv0 32) .cse1) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))))))) is different from true [2024-11-03 13:45:16,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:45:20,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:45:24,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:45:28,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]