./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/floats-cdfpl/newton_2_7.i --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/newton_2_7.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0a70ae82 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/floats-cdfpl/newton_2_7.i ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/newton_2_7.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-0a70ae8-m [2024-08-07 14:03:01,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-07 14:03:01,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-07 14:03:01,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-07 14:03:01,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-07 14:03:01,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-07 14:03:01,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-07 14:03:01,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-07 14:03:01,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-07 14:03:01,902 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-07 14:03:01,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-07 14:03:01,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-07 14:03:01,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-07 14:03:01,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-07 14:03:01,904 INFO L153 SettingsManager]: * Use SBE=true [2024-08-07 14:03:01,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-07 14:03:01,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-07 14:03:01,904 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-07 14:03:01,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-07 14:03:01,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-07 14:03:01,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-07 14:03:01,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-07 14:03:01,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-07 14:03:01,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-07 14:03:01,908 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-07 14:03:01,908 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-07 14:03:01,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-07 14:03:01,908 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-07 14:03:01,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-07 14:03:01,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-07 14:03:01,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-07 14:03:01,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-07 14:03:01,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-07 14:03:01,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-07 14:03:01,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-07 14:03:01,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-07 14:03:01,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-07 14:03:01,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-07 14:03:01,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-07 14:03:01,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-07 14:03:01,913 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-07 14:03:01,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-07 14:03:01,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-07 14:03:01,913 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-07 14:03:02,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-07 14:03:02,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-07 14:03:02,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-07 14:03:02,265 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-07 14:03:02,265 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-07 14:03:02,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/newton_2_7.yml/witness.yml [2024-08-07 14:03:02,350 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-07 14:03:02,351 INFO L274 PluginConnector]: CDTParser initialized [2024-08-07 14:03:02,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-cdfpl/newton_2_7.i [2024-08-07 14:03:04,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-07 14:03:04,207 INFO L384 CDTParser]: Found 1 translation units. [2024-08-07 14:03:04,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-cdfpl/newton_2_7.i [2024-08-07 14:03:04,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf9a9975/e773be858b3b459e922891a1ff8bb538/FLAGe858ddb5e [2024-08-07 14:03:04,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf9a9975/e773be858b3b459e922891a1ff8bb538 [2024-08-07 14:03:04,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-07 14:03:04,238 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-07 14:03:04,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-07 14:03:04,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-07 14:03:04,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-07 14:03:04,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:03:02" (1/2) ... [2024-08-07 14:03:04,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2353517d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:04, skipping insertion in model container [2024-08-07 14:03:04,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:03:02" (1/2) ... [2024-08-07 14:03:04,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6c1646f0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:04, skipping insertion in model container [2024-08-07 14:03:04,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:03:04" (2/2) ... [2024-08-07 14:03:04,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2353517d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:04, skipping insertion in model container [2024-08-07 14:03:04,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:03:04" (2/2) ... [2024-08-07 14:03:04,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-07 14:03:04,463 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cdfpl/newton_2_7.i[1743,1756] [2024-08-07 14:03:04,468 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:03:04,480 INFO L200 MainTranslator]: Completed pre-run [2024-08-07 14:03:04,500 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cdfpl/newton_2_7.i[1743,1756] [2024-08-07 14:03:04,503 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:03:04,520 INFO L204 MainTranslator]: Completed translation [2024-08-07 14:03:04,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:04 WrapperNode [2024-08-07 14:03:04,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-07 14:03:04,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-07 14:03:04,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-07 14:03:04,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-07 14:03:04,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:04" (1/1) ... [2024-08-07 14:03:04,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:04" (1/1) ... [2024-08-07 14:03:04,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:04" (1/1) ... [2024-08-07 14:03:04,559 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-07 14:03:04,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:04" (1/1) ... [2024-08-07 14:03:04,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:04" (1/1) ... [2024-08-07 14:03:04,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:04" (1/1) ... [2024-08-07 14:03:04,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:04" (1/1) ... [2024-08-07 14:03:04,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:04" (1/1) ... [2024-08-07 14:03:04,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-07 14:03:04,581 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-07 14:03:04,582 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-07 14:03:04,582 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-07 14:03:04,583 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:04" (1/1) ... [2024-08-07 14:03:04,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-07 14:03:04,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 14:03:04,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-07 14:03:04,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-07 14:03:04,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-07 14:03:04,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-07 14:03:04,673 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-07 14:03:04,674 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-07 14:03:04,674 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-08-07 14:03:04,674 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-08-07 14:03:04,674 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-07 14:03:04,674 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-07 14:03:04,676 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-07 14:03:04,676 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2024-08-07 14:03:04,676 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2024-08-07 14:03:04,676 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-07 14:03:04,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-07 14:03:04,676 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-07 14:03:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2024-08-07 14:03:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-08-07 14:03:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-08-07 14:03:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-07 14:03:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-07 14:03:04,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-07 14:03:04,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-07 14:03:04,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-07 14:03:04,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-07 14:03:04,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-07 14:03:04,759 INFO L273 CfgBuilder]: Building ICFG [2024-08-07 14:03:04,763 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-07 14:03:04,920 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-08-07 14:03:04,920 INFO L327 CfgBuilder]: Performing block encoding [2024-08-07 14:03:04,935 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-07 14:03:04,935 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-07 14:03:04,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:03:04 BoogieIcfgContainer [2024-08-07 14:03:04,936 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-07 14:03:04,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-07 14:03:04,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-07 14:03:04,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-07 14:03:04,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:03:02" (1/4) ... [2024-08-07 14:03:04,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cb31e5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 02:03:04, skipping insertion in model container [2024-08-07 14:03:04,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.08 02:03:04" (2/4) ... [2024-08-07 14:03:04,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cb31e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 02:03:04, skipping insertion in model container [2024-08-07 14:03:04,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:04" (3/4) ... [2024-08-07 14:03:04,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cb31e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 02:03:04, skipping insertion in model container [2024-08-07 14:03:04,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:03:04" (4/4) ... [2024-08-07 14:03:04,947 INFO L119 eAbstractionObserver]: Analyzing ICFG newton_2_7.i [2024-08-07 14:03:04,949 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-07 14:03:04,968 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-07 14:03:04,969 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-07 14:03:05,017 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,017 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,019 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,019 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,020 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,020 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,021 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,021 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,023 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,024 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,025 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,025 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,026 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,026 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,027 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,027 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,028 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,028 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,029 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,030 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,031 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,031 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,032 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,032 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,033 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,033 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,034 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,034 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,043 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:05,043 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:05,044 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:05,044 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:05,045 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:05,045 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:05,046 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:05,046 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:05,047 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:05,047 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:05,047 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:05,048 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:05,048 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:05,048 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:05,050 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,050 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,051 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,051 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,052 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,052 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,052 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,053 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,053 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,053 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,053 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,054 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,054 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,054 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,054 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,055 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,055 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,055 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,055 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,056 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,064 INFO L90 WitnessUtils]: NestedWordAutomaton nwa = ( callAlphabet = {"call #t~ret4 := f(~x~0);" "call #t~ret3 := fp(~IN~0);" "call #t~ret2 := f(~IN~0);" "call assume_abort_if_not((if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.4)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.4) then 1 else 0));" "call #t~ret6 := main();" "call ULTIMATE.init();" "call #t~ret5 := fp(~x~0);" }, internalAlphabet = {"~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0));" "assume true;" "assume 0 == ~cond;assume false;" "assume !(0 == ~cond);" "~cond := #in~cond;" "assume true;" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0));" "assume true;" "#res := 0;" "assume false;" "assume !false;" "assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);" "assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);" "~x~0 := ~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(#t~ret4, #t~ret5));havoc #t~ret4;havoc #t~ret5;" "SUMMARY for call #t~ret5 := fp(~x~0); srcloc: L44-1" "SUMMARY for call #t~ret4 := f(~x~0); srcloc: L44-2" "~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3;" "SUMMARY for call #t~ret3 := fp(~IN~0); srcloc: L42-1" "SUMMARY for call #t~ret2 := f(~IN~0); srcloc: L42-2" "SUMMARY for call assume_abort_if_not((if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.4)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.4) then 1 else 0)); srcloc: L40" "havoc #t~nondet1;~IN~0 := #t~nondet1;havoc #t~nondet1;" "assume true;" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "assume true;" "SUMMARY for call #t~ret6 := main(); srcloc: L-1" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "assume true;" }, returnAlphabet = {"#33#return;" "#35#return;" "#37#return;" "#39#return;" "#41#return;" "#43#return;" "#31#return;" }, states = {"CountingPredicate [underlying: 29#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 9#L51true, annotation: [1, 0]]" "CountingPredicate [underlying: 16#mainENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 5#L-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 25#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 11#L44-1true, annotation: [9, 0]]" "CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 4#fpFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 18#L53true, annotation: [13, 0]]" "CountingPredicate [underlying: 24#fpEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 18#L53true, annotation: [11, 0]]" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 13#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 11#L44-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 24#fpEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 20#fENTRYtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 18#L53true, annotation: [1, 0]]" "CountingPredicate [underlying: 28#mainFINALtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 28#mainFINALtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 22#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 21#L44-2true, annotation: [1, 0]]" "CountingPredicate [underlying: 23#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 21#L44-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 20#fENTRYtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 26#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 31#L50true, annotation: [11, 0]]" "CountingPredicate [underlying: 8#L42-2true, annotation: [1, 0]]" "CountingPredicate [underlying: 14#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 8#L42-2true, annotation: [3, 0]]" "CountingPredicate [underlying: 19#L44true, annotation: [1, 0]]" "CountingPredicate [underlying: 27#mainEXITtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 27#mainEXITtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 10#L40true, annotation: [0, 0]]" "CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 19#L44true, annotation: [11, 0]]" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 27#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 9#L51true, annotation: [12, 0]]" "CountingPredicate [underlying: 25#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 31#L50true, annotation: [1, 0]]" "CountingPredicate [underlying: 28#mainFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 17#L42-1true, annotation: [5, 0]]" "CountingPredicate [underlying: 4#fpFINALtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 26#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 17#L42-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 4#fpFINALtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 30#L24true, annotation: [1, 0]]" "CountingPredicate [underlying: 20#fENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 24#fpEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 15#L42true, annotation: [7, 0]]" "CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 15#L42true, annotation: [1, 0]]" "CountingPredicate [underlying: 7#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 23#assume_abort_if_notFINALtrue, annotation: [1, 0]]" }, initialStates = {"CountingPredicate [underlying: 14#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" }, finalStates = {"CountingPredicate [underlying: 26#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [13, 0]]" }, callTransitions = { ("CountingPredicate [underlying: 5#L-1true, annotation: [0, 0]]" "call #t~ret6 := main();" "CountingPredicate [underlying: 16#mainENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 11#L44-1true, annotation: [9, 0]]" "call #t~ret5 := fp(~x~0);" "CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 11#L44-1true, annotation: [1, 0]]" "call #t~ret5 := fp(~x~0);" "CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 21#L44-2true, annotation: [1, 0]]" "call #t~ret4 := f(~x~0);" "CountingPredicate [underlying: 20#fENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 21#L44-2true, annotation: [7, 0]]" "call #t~ret4 := f(~x~0);" "CountingPredicate [underlying: 20#fENTRYtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 8#L42-2true, annotation: [1, 0]]" "call #t~ret2 := f(~IN~0);" "CountingPredicate [underlying: 20#fENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 14#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "call ULTIMATE.init();" "CountingPredicate [underlying: 13#ULTIMATE.initENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 8#L42-2true, annotation: [3, 0]]" "call #t~ret2 := f(~IN~0);" "CountingPredicate [underlying: 20#fENTRYtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 10#L40true, annotation: [0, 0]]" "call assume_abort_if_not((if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.4)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.4) then 1 else 0));" "CountingPredicate [underlying: 29#assume_abort_if_notENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 17#L42-1true, annotation: [5, 0]]" "call #t~ret3 := fp(~IN~0);" "CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 17#L42-1true, annotation: [1, 0]]" "call #t~ret3 := fp(~IN~0);" "CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [1, 0]]") }, internalTransitions = { ("CountingPredicate [underlying: 29#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 30#L24true, annotation: [1, 0]]") ("CountingPredicate [underlying: 9#L51true, annotation: [1, 0]]" "assume false;" "CountingPredicate [underlying: 18#L53true, annotation: [1, 0]]") ("CountingPredicate [underlying: 9#L51true, annotation: [1, 0]]" "assume !false;" "CountingPredicate [underlying: 26#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 16#mainENTRYtrue, annotation: [0, 0]]" "havoc #t~nondet1;~IN~0 := #t~nondet1;havoc #t~nondet1;" "CountingPredicate [underlying: 10#L40true, annotation: [0, 0]]") ("CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [1, 0]]" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0));" "CountingPredicate [underlying: 4#fpFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [13, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 4#fpFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 24#fpEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 18#L53true, annotation: [13, 0]]" "#res := 0;" "CountingPredicate [underlying: 28#mainFINALtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 18#L53true, annotation: [11, 0]]" "#res := 0;" "CountingPredicate [underlying: 28#mainFINALtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 12#fFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 13#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "CountingPredicate [underlying: 22#ULTIMATE.initFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 20#fENTRYtrue, annotation: [4, 0]]" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0));" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 18#L53true, annotation: [1, 0]]" "#res := 0;" "CountingPredicate [underlying: 28#mainFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 28#mainFINALtrue, annotation: [13, 0]]" "assume true;" "CountingPredicate [underlying: 27#mainEXITtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 28#mainFINALtrue, annotation: [11, 0]]" "assume true;" "CountingPredicate [underlying: 27#mainEXITtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 22#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 7#ULTIMATE.initEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 23#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 25#assume_abort_if_notEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 20#fENTRYtrue, annotation: [8, 0]]" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0));" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 31#L50true, annotation: [11, 0]]" "assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);" "CountingPredicate [underlying: 9#L51true, annotation: [12, 0]]") ("CountingPredicate [underlying: 31#L50true, annotation: [11, 0]]" "assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);" "CountingPredicate [underlying: 18#L53true, annotation: [11, 0]]") ("CountingPredicate [underlying: 19#L44true, annotation: [1, 0]]" "~x~0 := ~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(#t~ret4, #t~ret5));havoc #t~ret4;havoc #t~ret5;" "CountingPredicate [underlying: 31#L50true, annotation: [1, 0]]") ("CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [6, 0]]" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0));" "CountingPredicate [underlying: 4#fpFINALtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 19#L44true, annotation: [11, 0]]" "~x~0 := ~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(#t~ret4, #t~ret5));havoc #t~ret4;havoc #t~ret5;" "CountingPredicate [underlying: 31#L50true, annotation: [11, 0]]") ("CountingPredicate [underlying: 12#fFINALtrue, annotation: [8, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 9#L51true, annotation: [12, 0]]" "assume false;" "CountingPredicate [underlying: 18#L53true, annotation: [13, 0]]") ("CountingPredicate [underlying: 9#L51true, annotation: [12, 0]]" "assume !false;" "CountingPredicate [underlying: 26#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 31#L50true, annotation: [1, 0]]" "assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);" "CountingPredicate [underlying: 9#L51true, annotation: [1, 0]]") ("CountingPredicate [underlying: 31#L50true, annotation: [1, 0]]" "assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);" "CountingPredicate [underlying: 18#L53true, annotation: [1, 0]]") ("CountingPredicate [underlying: 28#mainFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 27#mainEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 4#fpFINALtrue, annotation: [6, 0]]" "assume true;" "CountingPredicate [underlying: 24#fpEXITtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 12#fFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 4#fpFINALtrue, annotation: [10, 0]]" "assume true;" "CountingPredicate [underlying: 24#fpEXITtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 30#L24true, annotation: [1, 0]]" "assume 0 == ~cond;assume false;" "CountingPredicate [underlying: 23#assume_abort_if_notFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 30#L24true, annotation: [1, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 23#assume_abort_if_notFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 20#fENTRYtrue, annotation: [1, 0]]" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0));" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [11, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 15#L42true, annotation: [7, 0]]" "~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3;" "CountingPredicate [underlying: 21#L44-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [10, 0]]" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0));" "CountingPredicate [underlying: 4#fpFINALtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 15#L42true, annotation: [1, 0]]" "~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3;" "CountingPredicate [underlying: 21#L44-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 23#assume_abort_if_notFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 25#assume_abort_if_notEXITtrue, annotation: [1, 0]]") }, returnTransitions = { ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 8#L42-2true, annotation: [3, 0]]" "#37#return;" "CountingPredicate [underlying: 17#L42-1true, annotation: [5, 0]]") ("CountingPredicate [underlying: 25#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 10#L40true, annotation: [0, 0]]" "#39#return;" "CountingPredicate [underlying: 8#L42-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 24#fpEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 17#L42-1true, annotation: [5, 0]]" "#35#return;" "CountingPredicate [underlying: 15#L42true, annotation: [7, 0]]") ("CountingPredicate [underlying: 24#fpEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 11#L44-1true, annotation: [9, 0]]" "#31#return;" "CountingPredicate [underlying: 19#L44true, annotation: [11, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 21#L44-2true, annotation: [7, 0]]" "#33#return;" "CountingPredicate [underlying: 11#L44-1true, annotation: [9, 0]]") ("CountingPredicate [underlying: 27#mainEXITtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 5#L-1true, annotation: [0, 0]]" "#41#return;" "CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 27#mainEXITtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 5#L-1true, annotation: [0, 0]]" "#41#return;" "CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 8#L42-2true, annotation: [1, 0]]" "#37#return;" "CountingPredicate [underlying: 17#L42-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 21#L44-2true, annotation: [1, 0]]" "#33#return;" "CountingPredicate [underlying: 11#L44-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 27#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 5#L-1true, annotation: [0, 0]]" "#41#return;" "CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 25#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 10#L40true, annotation: [0, 0]]" "#39#return;" "CountingPredicate [underlying: 8#L42-2true, annotation: [3, 0]]") ("CountingPredicate [underlying: 24#fpEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 11#L44-1true, annotation: [1, 0]]" "#31#return;" "CountingPredicate [underlying: 19#L44true, annotation: [1, 0]]") ("CountingPredicate [underlying: 24#fpEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 17#L42-1true, annotation: [1, 0]]" "#35#return;" "CountingPredicate [underlying: 15#L42true, annotation: [1, 0]]") ("CountingPredicate [underlying: 7#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 14#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "#43#return;" "CountingPredicate [underlying: 5#L-1true, annotation: [0, 0]]") } ); [2024-08-07 14:03:05,070 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-08-07 14:03:05,072 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,072 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,072 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,072 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,073 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,073 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,073 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,074 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,074 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,074 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,075 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,075 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,076 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,076 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,076 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,077 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,077 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,079 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,080 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,086 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,087 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,087 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,087 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,087 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,088 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,088 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,088 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,088 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,094 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:05,094 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:05,094 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:05,095 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:05,095 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:05,095 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:05,095 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:05,095 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:05,096 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:05,096 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:05,096 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:05,099 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:05,100 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:05,100 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:05,101 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,101 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,101 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,101 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,102 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,102 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,102 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,102 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,103 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,103 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,103 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,103 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,104 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,104 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,104 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,104 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,105 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,105 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,105 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:05,105 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:05,111 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 64 states to 32 states. [2024-08-07 14:03:05,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-07 14:03:05,136 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=false, 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;@39554d19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-07 14:03:05,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-07 14:03:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2024-08-07 14:03:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-08-07 14:03:05,142 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 14:03:05,143 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-07 14:03:05,144 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 14:03:05,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 14:03:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1919923536, now seen corresponding path program 1 times [2024-08-07 14:03:05,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 14:03:05,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405897327] [2024-08-07 14:03:05,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 14:03:05,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 14:03:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:03:05,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-07 14:03:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:03:05,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-07 14:03:05,306 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-07 14:03:05,307 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-07 14:03:05,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-07 14:03:05,315 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-07 14:03:05,319 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-07 14:03:05,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.08 02:03:05 BoogieIcfgContainer [2024-08-07 14:03:05,337 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-07 14:03:05,339 INFO L158 Benchmark]: Toolchain (without parser) took 1100.71ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 29.7MB in the beginning and 41.2MB in the end (delta: -11.4MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-08-07 14:03:05,340 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 58.7MB. Free memory was 35.0MB in the beginning and 34.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:03:05,341 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 32.5MB in the beginning and 32.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:03:05,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.06ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 29.4MB in the beginning and 57.0MB in the end (delta: -27.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-08-07 14:03:05,342 INFO L158 Benchmark]: Boogie Preprocessor took 57.26ms. Allocated memory is still 81.8MB. Free memory was 57.0MB in the beginning and 54.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-07 14:03:05,343 INFO L158 Benchmark]: IcfgBuilder took 355.71ms. Allocated memory is still 81.8MB. Free memory was 54.6MB in the beginning and 43.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-07 14:03:05,343 INFO L158 Benchmark]: TraceAbstraction took 398.35ms. Allocated memory is still 81.8MB. Free memory was 42.4MB in the beginning and 41.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.7MB. Max. memory is 16.1GB. [2024-08-07 14:03:05,347 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.21ms. Allocated memory is still 58.7MB. Free memory was 35.0MB in the beginning and 34.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 32.5MB in the beginning and 32.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.06ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 29.4MB in the beginning and 57.0MB in the end (delta: -27.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.26ms. Allocated memory is still 81.8MB. Free memory was 57.0MB in the beginning and 54.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 355.71ms. Allocated memory is still 81.8MB. Free memory was 54.6MB in the beginning and 43.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 398.35ms. Allocated memory is still 81.8MB. Free memory was 42.4MB in the beginning and 41.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.7MB. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 51]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryArithmeticFLOAToperation at line 44. Possible FailurePath: [L39] float IN = __VERIFIER_nondet_float(); [L40] CALL assume_abort_if_not(IN > -1.4f && IN < 1.4f) VAL [\old(cond)=1] [L24] !cond VAL [\old(cond)=1] [L40] RET assume_abort_if_not(IN > -1.4f && IN < 1.4f) [L42] CALL, EXPR f(IN) VAL [\old(x)=53] [L29] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=53] [L42] RET, EXPR f(IN) VAL [IN=53] [L42] CALL, EXPR fp(IN) VAL [\old(x)=53] [L34] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=53] [L42] RET, EXPR fp(IN) VAL [IN=53] [L42] float x = IN - f(IN)/fp(IN); [L44] CALL, EXPR f(x) VAL [\old(x)=54] [L29] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=54] [L44] RET, EXPR f(x) VAL [IN=53, x=54] [L44] CALL, EXPR fp(x) VAL [\old(x)=54] [L34] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=54] [L44] RET, EXPR fp(x) VAL [IN=53, x=54] [L44] x = x - f(x)/fp(x) [L50] !(x < 0.1) VAL [IN=53] [L51] reach_error() VAL [IN=53] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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: unable to determine feasibility of some traces [2024-08-07 14:03:05,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/floats-cdfpl/newton_2_7.i ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/newton_2_7.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-0a70ae8-m [2024-08-07 14:03:07,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-07 14:03:07,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-08-07 14:03:07,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-07 14:03:07,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-07 14:03:07,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-07 14:03:07,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-07 14:03:07,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-07 14:03:07,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-07 14:03:07,634 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-07 14:03:07,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-07 14:03:07,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-07 14:03:07,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-07 14:03:07,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-07 14:03:07,636 INFO L153 SettingsManager]: * Use SBE=true [2024-08-07 14:03:07,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-07 14:03:07,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-07 14:03:07,637 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-07 14:03:07,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-07 14:03:07,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-07 14:03:07,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-07 14:03:07,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-07 14:03:07,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-07 14:03:07,639 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-07 14:03:07,639 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-07 14:03:07,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-07 14:03:07,640 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-07 14:03:07,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-07 14:03:07,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-07 14:03:07,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-07 14:03:07,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-07 14:03:07,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-07 14:03:07,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-07 14:03:07,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-07 14:03:07,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-07 14:03:07,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-07 14:03:07,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-07 14:03:07,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-07 14:03:07,643 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-07 14:03:07,643 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-07 14:03:07,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-07 14:03:07,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-07 14:03:07,644 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-07 14:03:07,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-07 14:03:07,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-07 14:03:07,644 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-07 14:03:07,644 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-07 14:03:07,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-07 14:03:08,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-07 14:03:08,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-07 14:03:08,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-07 14:03:08,013 INFO L274 PluginConnector]: CDTParser initialized [2024-08-07 14:03:08,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-cdfpl/newton_2_7.i [2024-08-07 14:03:09,589 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-07 14:03:09,800 INFO L384 CDTParser]: Found 1 translation units. [2024-08-07 14:03:09,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-cdfpl/newton_2_7.i [2024-08-07 14:03:09,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/734bb40d5/7f9b77388ef94392bbe2142b122edf12/FLAG5e92e1d9e [2024-08-07 14:03:10,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/734bb40d5/7f9b77388ef94392bbe2142b122edf12 [2024-08-07 14:03:10,173 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-07 14:03:10,174 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-07 14:03:10,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/newton_2_7.yml/witness.yml [2024-08-07 14:03:10,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-07 14:03:10,250 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-07 14:03:10,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-07 14:03:10,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-07 14:03:10,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-07 14:03:10,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:03:10" (1/2) ... [2024-08-07 14:03:10,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71bc59ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:10, skipping insertion in model container [2024-08-07 14:03:10,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:03:10" (1/2) ... [2024-08-07 14:03:10,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4820d627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:10, skipping insertion in model container [2024-08-07 14:03:10,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:03:10" (2/2) ... [2024-08-07 14:03:10,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71bc59ee and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:10, skipping insertion in model container [2024-08-07 14:03:10,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:03:10" (2/2) ... [2024-08-07 14:03:10,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-07 14:03:10,459 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cdfpl/newton_2_7.i[1743,1756] [2024-08-07 14:03:10,463 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:03:10,488 INFO L200 MainTranslator]: Completed pre-run [2024-08-07 14:03:10,511 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cdfpl/newton_2_7.i[1743,1756] [2024-08-07 14:03:10,511 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:03:10,532 INFO L204 MainTranslator]: Completed translation [2024-08-07 14:03:10,532 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:10 WrapperNode [2024-08-07 14:03:10,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-07 14:03:10,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-07 14:03:10,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-07 14:03:10,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-07 14:03:10,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:10" (1/1) ... [2024-08-07 14:03:10,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:10" (1/1) ... [2024-08-07 14:03:10,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:10" (1/1) ... [2024-08-07 14:03:10,583 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-07 14:03:10,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:10" (1/1) ... [2024-08-07 14:03:10,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:10" (1/1) ... [2024-08-07 14:03:10,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:10" (1/1) ... [2024-08-07 14:03:10,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:10" (1/1) ... [2024-08-07 14:03:10,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:10" (1/1) ... [2024-08-07 14:03:10,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-07 14:03:10,611 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-07 14:03:10,611 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-07 14:03:10,611 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-07 14:03:10,612 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:10" (1/1) ... [2024-08-07 14:03:10,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-07 14:03:10,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 14:03:10,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-07 14:03:10,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-07 14:03:10,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-07 14:03:10,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-07 14:03:10,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2024-08-07 14:03:10,709 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-07 14:03:10,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-07 14:03:10,709 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-08-07 14:03:10,709 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-08-07 14:03:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-07 14:03:10,711 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-07 14:03:10,711 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-07 14:03:10,711 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2024-08-07 14:03:10,711 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2024-08-07 14:03:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-07 14:03:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-07 14:03:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-07 14:03:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2024-08-07 14:03:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-08-07 14:03:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-08-07 14:03:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-07 14:03:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-07 14:03:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-07 14:03:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-07 14:03:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2024-08-07 14:03:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-07 14:03:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-07 14:03:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-07 14:03:10,826 INFO L273 CfgBuilder]: Building ICFG [2024-08-07 14:03:10,830 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-07 14:03:30,848 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-08-07 14:03:30,850 INFO L327 CfgBuilder]: Performing block encoding [2024-08-07 14:03:30,861 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-07 14:03:30,861 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-07 14:03:30,862 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:03:30 BoogieIcfgContainer [2024-08-07 14:03:30,862 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-07 14:03:30,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-07 14:03:30,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-07 14:03:30,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-07 14:03:30,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.08 02:03:10" (1/4) ... [2024-08-07 14:03:30,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b547a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 02:03:30, skipping insertion in model container [2024-08-07 14:03:30,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:03:10" (2/4) ... [2024-08-07 14:03:30,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b547a1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 02:03:30, skipping insertion in model container [2024-08-07 14:03:30,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:10" (3/4) ... [2024-08-07 14:03:30,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b547a1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 02:03:30, skipping insertion in model container [2024-08-07 14:03:30,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:03:30" (4/4) ... [2024-08-07 14:03:30,875 INFO L119 eAbstractionObserver]: Analyzing ICFG newton_2_7.i [2024-08-07 14:03:30,875 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-07 14:03:30,898 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-07 14:03:30,898 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-07 14:03:30,953 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,954 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,956 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,957 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,958 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,958 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,959 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,959 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,962 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,963 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,964 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,966 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,967 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,967 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,968 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,968 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,969 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,969 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,970 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,970 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,970 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,971 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,971 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,972 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,972 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,972 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,973 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,973 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,976 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:30,976 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:30,976 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:30,977 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:30,977 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:30,978 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:30,978 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:30,978 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:30,979 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:30,979 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:30,980 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:30,980 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:30,981 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:30,981 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:30,983 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,983 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,984 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,984 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,985 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,985 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,985 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,986 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,986 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,986 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,987 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,987 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,987 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,987 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,988 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,988 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,988 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,988 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,988 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:30,988 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:30,998 INFO L90 WitnessUtils]: NestedWordAutomaton nwa = ( callAlphabet = {"call #t~ret6 := main();" "call ULTIMATE.init();" "call #t~ret5 := fp(~x~0);" "call #t~ret4 := f(~x~0);" "call #t~ret3 := fp(~IN~0);" "call #t~ret2 := f(~IN~0);" "call assume_abort_if_not((if ~fp.gt~32(~IN~0, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1.4))) && ~fp.lt~32(~IN~0, ~to_fp~32(currentRoundingMode, 1.4)) then 1bv32 else 0bv32));" }, internalAlphabet = {"~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~x, ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~to_fp~32(currentRoundingMode, 6.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 120.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 5040.0)));" "assume true;" "assume 0bv32 == ~cond;assume false;" "assume !(0bv32 == ~cond);" "~cond := #in~cond;" "assume true;" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~convertINTToFLOAT(currentRoundingMode, 1bv32), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~to_fp~32(currentRoundingMode, 2.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 24.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 720.0)));" "assume true;" "#res := 0bv32;" "assume false;" "assume !false;" "assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));" "assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));" "~x~0 := ~fp.sub~32(currentRoundingMode, ~x~0, ~fp.div~32(currentRoundingMode, #t~ret4, #t~ret5));havoc #t~ret4;havoc #t~ret5;" "SUMMARY for call #t~ret5 := fp(~x~0); srcloc: L44-1" "SUMMARY for call #t~ret4 := f(~x~0); srcloc: L44-2" "~x~0 := ~fp.sub~32(currentRoundingMode, ~IN~0, ~fp.div~32(currentRoundingMode, #t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3;" "SUMMARY for call #t~ret3 := fp(~IN~0); srcloc: L42-1" "SUMMARY for call #t~ret2 := f(~IN~0); srcloc: L42-2" "SUMMARY for call assume_abort_if_not((if ~fp.gt~32(~IN~0, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1.4))) && ~fp.lt~32(~IN~0, ~to_fp~32(currentRoundingMode, 1.4)) then 1bv32 else 0bv32)); srcloc: L40" "havoc #t~nondet1;~IN~0 := #t~nondet1;havoc #t~nondet1;" "assume true;" "assume 0bv1 == #valid[0bv32];assume ~bvult~32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1#0(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1#0(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);" "assume true;" "SUMMARY for call #t~ret6 := main(); srcloc: L-1" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "assume true;" }, returnAlphabet = {"#48#return;" "#50#return;" "#52#return;" "#40#return;" "#42#return;" "#44#return;" "#46#return;" }, states = {"CountingPredicate [underlying: 29#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 9#L51true, annotation: [1, 0]]" "CountingPredicate [underlying: 16#mainENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 5#L-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 25#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 11#L44-1true, annotation: [9, 0]]" "CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 4#fpFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 18#L53true, annotation: [13, 0]]" "CountingPredicate [underlying: 24#fpEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 18#L53true, annotation: [11, 0]]" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 13#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 11#L44-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 24#fpEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 20#fENTRYtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 18#L53true, annotation: [1, 0]]" "CountingPredicate [underlying: 28#mainFINALtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 28#mainFINALtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 22#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 21#L44-2true, annotation: [1, 0]]" "CountingPredicate [underlying: 23#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 21#L44-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 20#fENTRYtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 26#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 31#L50true, annotation: [11, 0]]" "CountingPredicate [underlying: 8#L42-2true, annotation: [1, 0]]" "CountingPredicate [underlying: 14#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 8#L42-2true, annotation: [3, 0]]" "CountingPredicate [underlying: 19#L44true, annotation: [1, 0]]" "CountingPredicate [underlying: 27#mainEXITtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 27#mainEXITtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 10#L40true, annotation: [0, 0]]" "CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 19#L44true, annotation: [11, 0]]" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 27#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 9#L51true, annotation: [12, 0]]" "CountingPredicate [underlying: 25#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 31#L50true, annotation: [1, 0]]" "CountingPredicate [underlying: 28#mainFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 17#L42-1true, annotation: [5, 0]]" "CountingPredicate [underlying: 4#fpFINALtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 26#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 17#L42-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 4#fpFINALtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 30#L24true, annotation: [1, 0]]" "CountingPredicate [underlying: 20#fENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 24#fpEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 15#L42true, annotation: [7, 0]]" "CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 15#L42true, annotation: [1, 0]]" "CountingPredicate [underlying: 7#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 23#assume_abort_if_notFINALtrue, annotation: [1, 0]]" }, initialStates = {"CountingPredicate [underlying: 14#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" }, finalStates = {"CountingPredicate [underlying: 26#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [13, 0]]" }, callTransitions = { ("CountingPredicate [underlying: 5#L-1true, annotation: [0, 0]]" "call #t~ret6 := main();" "CountingPredicate [underlying: 16#mainENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 11#L44-1true, annotation: [9, 0]]" "call #t~ret5 := fp(~x~0);" "CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 11#L44-1true, annotation: [1, 0]]" "call #t~ret5 := fp(~x~0);" "CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 21#L44-2true, annotation: [1, 0]]" "call #t~ret4 := f(~x~0);" "CountingPredicate [underlying: 20#fENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 21#L44-2true, annotation: [7, 0]]" "call #t~ret4 := f(~x~0);" "CountingPredicate [underlying: 20#fENTRYtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 8#L42-2true, annotation: [1, 0]]" "call #t~ret2 := f(~IN~0);" "CountingPredicate [underlying: 20#fENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 14#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "call ULTIMATE.init();" "CountingPredicate [underlying: 13#ULTIMATE.initENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 8#L42-2true, annotation: [3, 0]]" "call #t~ret2 := f(~IN~0);" "CountingPredicate [underlying: 20#fENTRYtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 10#L40true, annotation: [0, 0]]" "call assume_abort_if_not((if ~fp.gt~32(~IN~0, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1.4))) && ~fp.lt~32(~IN~0, ~to_fp~32(currentRoundingMode, 1.4)) then 1bv32 else 0bv32));" "CountingPredicate [underlying: 29#assume_abort_if_notENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 17#L42-1true, annotation: [5, 0]]" "call #t~ret3 := fp(~IN~0);" "CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 17#L42-1true, annotation: [1, 0]]" "call #t~ret3 := fp(~IN~0);" "CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [1, 0]]") }, internalTransitions = { ("CountingPredicate [underlying: 29#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 30#L24true, annotation: [1, 0]]") ("CountingPredicate [underlying: 9#L51true, annotation: [1, 0]]" "assume false;" "CountingPredicate [underlying: 18#L53true, annotation: [1, 0]]") ("CountingPredicate [underlying: 9#L51true, annotation: [1, 0]]" "assume !false;" "CountingPredicate [underlying: 26#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 16#mainENTRYtrue, annotation: [0, 0]]" "havoc #t~nondet1;~IN~0 := #t~nondet1;havoc #t~nondet1;" "CountingPredicate [underlying: 10#L40true, annotation: [0, 0]]") ("CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [1, 0]]" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~convertINTToFLOAT(currentRoundingMode, 1bv32), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~to_fp~32(currentRoundingMode, 2.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 24.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 720.0)));" "CountingPredicate [underlying: 4#fpFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [13, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 4#fpFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 24#fpEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 18#L53true, annotation: [13, 0]]" "#res := 0bv32;" "CountingPredicate [underlying: 28#mainFINALtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 18#L53true, annotation: [11, 0]]" "#res := 0bv32;" "CountingPredicate [underlying: 28#mainFINALtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 12#fFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 13#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "assume 0bv1 == #valid[0bv32];assume ~bvult~32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1#0(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1#0(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);" "CountingPredicate [underlying: 22#ULTIMATE.initFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 20#fENTRYtrue, annotation: [4, 0]]" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~x, ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~to_fp~32(currentRoundingMode, 6.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 120.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 5040.0)));" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 18#L53true, annotation: [1, 0]]" "#res := 0bv32;" "CountingPredicate [underlying: 28#mainFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 28#mainFINALtrue, annotation: [13, 0]]" "assume true;" "CountingPredicate [underlying: 27#mainEXITtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 28#mainFINALtrue, annotation: [11, 0]]" "assume true;" "CountingPredicate [underlying: 27#mainEXITtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 22#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 7#ULTIMATE.initEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 23#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 25#assume_abort_if_notEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 20#fENTRYtrue, annotation: [8, 0]]" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~x, ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~to_fp~32(currentRoundingMode, 6.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 120.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 5040.0)));" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 31#L50true, annotation: [11, 0]]" "assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));" "CountingPredicate [underlying: 9#L51true, annotation: [12, 0]]") ("CountingPredicate [underlying: 31#L50true, annotation: [11, 0]]" "assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));" "CountingPredicate [underlying: 18#L53true, annotation: [11, 0]]") ("CountingPredicate [underlying: 19#L44true, annotation: [1, 0]]" "~x~0 := ~fp.sub~32(currentRoundingMode, ~x~0, ~fp.div~32(currentRoundingMode, #t~ret4, #t~ret5));havoc #t~ret4;havoc #t~ret5;" "CountingPredicate [underlying: 31#L50true, annotation: [1, 0]]") ("CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [6, 0]]" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~convertINTToFLOAT(currentRoundingMode, 1bv32), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~to_fp~32(currentRoundingMode, 2.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 24.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 720.0)));" "CountingPredicate [underlying: 4#fpFINALtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 19#L44true, annotation: [11, 0]]" "~x~0 := ~fp.sub~32(currentRoundingMode, ~x~0, ~fp.div~32(currentRoundingMode, #t~ret4, #t~ret5));havoc #t~ret4;havoc #t~ret5;" "CountingPredicate [underlying: 31#L50true, annotation: [11, 0]]") ("CountingPredicate [underlying: 12#fFINALtrue, annotation: [8, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 9#L51true, annotation: [12, 0]]" "assume false;" "CountingPredicate [underlying: 18#L53true, annotation: [13, 0]]") ("CountingPredicate [underlying: 9#L51true, annotation: [12, 0]]" "assume !false;" "CountingPredicate [underlying: 26#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 31#L50true, annotation: [1, 0]]" "assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));" "CountingPredicate [underlying: 9#L51true, annotation: [1, 0]]") ("CountingPredicate [underlying: 31#L50true, annotation: [1, 0]]" "assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));" "CountingPredicate [underlying: 18#L53true, annotation: [1, 0]]") ("CountingPredicate [underlying: 28#mainFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 27#mainEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 4#fpFINALtrue, annotation: [6, 0]]" "assume true;" "CountingPredicate [underlying: 24#fpEXITtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 12#fFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 4#fpFINALtrue, annotation: [10, 0]]" "assume true;" "CountingPredicate [underlying: 24#fpEXITtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 30#L24true, annotation: [1, 0]]" "assume 0bv32 == ~cond;assume false;" "CountingPredicate [underlying: 23#assume_abort_if_notFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 30#L24true, annotation: [1, 0]]" "assume !(0bv32 == ~cond);" "CountingPredicate [underlying: 23#assume_abort_if_notFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 20#fENTRYtrue, annotation: [1, 0]]" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~x, ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~to_fp~32(currentRoundingMode, 6.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 120.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 5040.0)));" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [11, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 15#L42true, annotation: [7, 0]]" "~x~0 := ~fp.sub~32(currentRoundingMode, ~IN~0, ~fp.div~32(currentRoundingMode, #t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3;" "CountingPredicate [underlying: 21#L44-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 6#fpENTRYtrue, annotation: [10, 0]]" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~convertINTToFLOAT(currentRoundingMode, 1bv32), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~to_fp~32(currentRoundingMode, 2.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 24.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 720.0)));" "CountingPredicate [underlying: 4#fpFINALtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 15#L42true, annotation: [1, 0]]" "~x~0 := ~fp.sub~32(currentRoundingMode, ~IN~0, ~fp.div~32(currentRoundingMode, #t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3;" "CountingPredicate [underlying: 21#L44-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 23#assume_abort_if_notFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 25#assume_abort_if_notEXITtrue, annotation: [1, 0]]") }, returnTransitions = { ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 8#L42-2true, annotation: [3, 0]]" "#46#return;" "CountingPredicate [underlying: 17#L42-1true, annotation: [5, 0]]") ("CountingPredicate [underlying: 25#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 10#L40true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 8#L42-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 24#fpEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 17#L42-1true, annotation: [5, 0]]" "#44#return;" "CountingPredicate [underlying: 15#L42true, annotation: [7, 0]]") ("CountingPredicate [underlying: 24#fpEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 11#L44-1true, annotation: [9, 0]]" "#40#return;" "CountingPredicate [underlying: 19#L44true, annotation: [11, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 21#L44-2true, annotation: [7, 0]]" "#42#return;" "CountingPredicate [underlying: 11#L44-1true, annotation: [9, 0]]") ("CountingPredicate [underlying: 27#mainEXITtrue, annotation: [13, 0]]" "CountingPredicate [underlying: 5#L-1true, annotation: [0, 0]]" "#50#return;" "CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [13, 0]]") ("CountingPredicate [underlying: 27#mainEXITtrue, annotation: [11, 0]]" "CountingPredicate [underlying: 5#L-1true, annotation: [0, 0]]" "#50#return;" "CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [11, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 8#L42-2true, annotation: [1, 0]]" "#46#return;" "CountingPredicate [underlying: 17#L42-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 21#L44-2true, annotation: [1, 0]]" "#42#return;" "CountingPredicate [underlying: 11#L44-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 27#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 5#L-1true, annotation: [0, 0]]" "#50#return;" "CountingPredicate [underlying: 32#ULTIMATE.startFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 25#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 10#L40true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 8#L42-2true, annotation: [3, 0]]") ("CountingPredicate [underlying: 24#fpEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 11#L44-1true, annotation: [1, 0]]" "#40#return;" "CountingPredicate [underlying: 19#L44true, annotation: [1, 0]]") ("CountingPredicate [underlying: 24#fpEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 17#L42-1true, annotation: [1, 0]]" "#44#return;" "CountingPredicate [underlying: 15#L42true, annotation: [1, 0]]") ("CountingPredicate [underlying: 7#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 14#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "#52#return;" "CountingPredicate [underlying: 5#L-1true, annotation: [0, 0]]") } ); [2024-08-07 14:03:31,004 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-08-07 14:03:31,005 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,006 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,006 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,006 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,007 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,007 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,007 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,007 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,008 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,008 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,009 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,009 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,009 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,010 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,010 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,010 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,011 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,011 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,011 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,012 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,012 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,023 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,024 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,024 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,024 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,024 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,025 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,025 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,027 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:31,027 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:31,027 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:31,027 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:31,028 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:31,028 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:31,028 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:31,029 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:31,029 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:31,029 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:31,029 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:31,030 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:31,030 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:31,030 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:31,031 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,031 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,032 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,032 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,032 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,032 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,033 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,033 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,033 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,033 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,034 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,034 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,034 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,034 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,034 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,035 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,035 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,035 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,035 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:31,036 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:31,041 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 64 states to 32 states. [2024-08-07 14:03:31,060 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-07 14:03:31,071 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=false, 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;@50a6f6be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-07 14:03:31,071 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-07 14:03:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2024-08-07 14:03:31,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-08-07 14:03:31,078 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 14:03:31,079 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-07 14:03:31,080 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 14:03:31,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 14:03:31,087 INFO L85 PathProgramCache]: Analyzing trace with hash -401094535, now seen corresponding path program 1 times [2024-08-07 14:03:31,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-07 14:03:31,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912820338] [2024-08-07 14:03:31,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 14:03:31,100 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 [2024-08-07 14:03:31,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-07 14:03:31,103 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) [2024-08-07 14:03:31,104 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 [2024-08-07 14:05:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:05:57,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-07 14:16:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:16:57,881 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-07 14:16:57,882 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-07 14:16:57,883 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-07 14:16:57,980 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 [2024-08-07 14:16:58,085 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 [2024-08-07 14:16:58,090 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-07 14:16:58,093 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-07 14:16:58,110 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.08 02:16:58 BoogieIcfgContainer [2024-08-07 14:16:58,111 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-07 14:16:58,112 INFO L158 Benchmark]: Toolchain (without parser) took 827861.45ms. Allocated memory is still 71.3MB. Free memory was 45.5MB in the beginning and 33.4MB in the end (delta: 12.1MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-08-07 14:16:58,112 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory is still 28.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:16:58,112 INFO L158 Benchmark]: Witness Parser took 0.08ms. Allocated memory is still 71.3MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:16:58,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.72ms. Allocated memory is still 71.3MB. Free memory was 45.3MB in the beginning and 33.2MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-08-07 14:16:58,113 INFO L158 Benchmark]: Boogie Preprocessor took 75.41ms. Allocated memory is still 71.3MB. Free memory was 32.9MB in the beginning and 30.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-07 14:16:58,114 INFO L158 Benchmark]: IcfgBuilder took 20251.24ms. Allocated memory is still 71.3MB. Free memory was 30.6MB in the beginning and 40.1MB in the end (delta: -9.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-08-07 14:16:58,114 INFO L158 Benchmark]: TraceAbstraction took 807244.36ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 33.4MB in the end (delta: 6.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-08-07 14:16:58,116 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.18ms. Allocated memory is still 52.4MB. Free memory is still 28.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.08ms. Allocated memory is still 71.3MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.72ms. Allocated memory is still 71.3MB. Free memory was 45.3MB in the beginning and 33.2MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.41ms. Allocated memory is still 71.3MB. Free memory was 32.9MB in the beginning and 30.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 20251.24ms. Allocated memory is still 71.3MB. Free memory was 30.6MB in the beginning and 40.1MB in the end (delta: -9.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 807244.36ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 33.4MB in the end (delta: 6.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 51]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L39] float IN = __VERIFIER_nondet_float(); [L40] CALL assume_abort_if_not(IN > -1.4f && IN < 1.4f) VAL [\old(cond)=1] [L24] !cond VAL [\old(cond)=1] [L40] RET assume_abort_if_not(IN > -1.4f && IN < 1.4f) VAL [IN=-1.2598227262496948] [L42] CALL, EXPR f(IN) VAL [\old(x)=-1.2598227262496948] [L29] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=-1.2598227262496948, \result=-0.9540131688117981] [L42] RET, EXPR f(IN) VAL [IN=-1.2598227262496948] [L42] CALL, EXPR fp(IN) VAL [\old(x)=-1.2598227262496948] [L34] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=-1.2598227262496948, \result=0.3169369399547577] [L42] RET, EXPR fp(IN) VAL [IN=-1.2598227262496948] [L42] float x = IN - f(IN)/fp(IN); [L44] CALL, EXPR f(x) VAL [\old(x)=1.7502812147140503] [L29] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=1.7502812147140503, \result=1.0034914016723633] [L44] RET, EXPR f(x) VAL [x=1.7502812147140503] [L44] CALL, EXPR fp(x) VAL [\old(x)=1.7502812147140503] [L34] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=1.7502812147140503, \result=-0.10077176988124847] [L44] RET, EXPR fp(x) VAL [x=1.7502812147140503] [L44] x = x - f(x)/fp(x) [L50] !(x < 0.1) [L51] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 807.2s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 146.4s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2024-08-07 14:16:58,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE