./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_poly.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version a0165632
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:30:38,613 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:30:38,693 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 18:30:38,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:30:38,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:30:38,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:30:38,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:30:38,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:30:38,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:30:38,741 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:30:38,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:30:38,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:30:38,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:30:38,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:30:38,743 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:30:38,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:30:38,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 18:30:38,746 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:30:38,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 18:30:38,747 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:30:38,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:30:38,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 18:30:38,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:30:38,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 18:30:38,752 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:30:38,752 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:30:38,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 18:30:38,753 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:30:38,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:30:38,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:30:38,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:30:38,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:30:38,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:30:38,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:30:38,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:30:38,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 18:30:38,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 18:30:38,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 18:30:38,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:30:38,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:30:38,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:30:38,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:30:38,760 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/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.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8
[2024-11-08 18:30:39,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:30:39,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:30:39,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:30:39,108 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:30:39,110 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:30:39,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/float-benchs/sqrt_poly.c
Unable to find full path for "g++"
[2024-11-08 18:30:41,261 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:30:41,444 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:30:41,445 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/sv-benchmarks/c/float-benchs/sqrt_poly.c
[2024-11-08 18:30:41,453 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/data/2a9f121de/046d10f109324dbca762a7378992ed95/FLAGc3f923766
[2024-11-08 18:30:41,466 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/data/2a9f121de/046d10f109324dbca762a7378992ed95
[2024-11-08 18:30:41,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:30:41,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:30:41,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:30:41,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:30:41,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:30:41,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:30:41" (1/1) ...
[2024-11-08 18:30:41,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ea4d0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:41, skipping insertion in model container
[2024-11-08 18:30:41,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:30:41" (1/1) ...
[2024-11-08 18:30:41,511 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:30:41,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684]
[2024-11-08 18:30:41,754 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:30:41,768 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:30:41,779 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684]
[2024-11-08 18:30:41,783 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:30:41,801 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:30:41,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:41 WrapperNode
[2024-11-08 18:30:41,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:30:41,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:30:41,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:30:41,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:30:41,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:41" (1/1) ...
[2024-11-08 18:30:41,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:41" (1/1) ...
[2024-11-08 18:30:41,839 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 31
[2024-11-08 18:30:41,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:30:41,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:30:41,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:30:41,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:30:41,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:41" (1/1) ...
[2024-11-08 18:30:41,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:41" (1/1) ...
[2024-11-08 18:30:41,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:41" (1/1) ...
[2024-11-08 18:30:41,867 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-11-08 18:30:41,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:41" (1/1) ...
[2024-11-08 18:30:41,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:41" (1/1) ...
[2024-11-08 18:30:41,872 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:41" (1/1) ...
[2024-11-08 18:30:41,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:41" (1/1) ...
[2024-11-08 18:30:41,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:41" (1/1) ...
[2024-11-08 18:30:41,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:41" (1/1) ...
[2024-11-08 18:30:41,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:30:41,879 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:30:41,879 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:30:41,879 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:30:41,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:41" (1/1) ...
[2024-11-08 18:30:41,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:30:41,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:30:41,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:30:41,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:30:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:30:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 18:30:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:30:41,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:30:42,016 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:30:42,018 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:30:42,117 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live.
[2024-11-08 18:30:42,118 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:30:42,129 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:30:42,130 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 18:30:42,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:30:42 BoogieIcfgContainer
[2024-11-08 18:30:42,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:30:42,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:30:42,134 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:30:42,137 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:30:42,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:30:41" (1/3) ...
[2024-11-08 18:30:42,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241794a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:30:42, skipping insertion in model container
[2024-11-08 18:30:42,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:41" (2/3) ...
[2024-11-08 18:30:42,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241794a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:30:42, skipping insertion in model container
[2024-11-08 18:30:42,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:30:42" (3/3) ...
[2024-11-08 18:30:42,141 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c
[2024-11-08 18:30:42,161 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:30:42,162 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 18:30:42,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:30:42,238 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5f568a1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:30:42,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 18:30:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:30:42,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-08 18:30:42,250 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:30:42,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:30:42,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:30:42,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:30:42,258 INFO L85 PathProgramCache]: Analyzing trace with hash 119383821, now seen corresponding path program 1 times
[2024-11-08 18:30:42,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:30:42,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056395122]
[2024-11-08 18:30:42,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:30:42,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:30:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:30:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:30:42,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:30:42,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056395122]
[2024-11-08 18:30:42,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056395122] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:30:42,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:30:42,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 18:30:42,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906090245]
[2024-11-08 18:30:42,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:30:42,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 18:30:42,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:30:42,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 18:30:42,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:30:42,441 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:30:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:30:42,450 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions.
[2024-11-08 18:30:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 18:30:42,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2024-11-08 18:30:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:30:42,460 INFO L225 Difference]: With dead ends: 23
[2024-11-08 18:30:42,461 INFO L226 Difference]: Without dead ends: 9
[2024-11-08 18:30:42,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:30:42,467 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:30:42,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:30:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states.
[2024-11-08 18:30:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2024-11-08 18:30:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:30:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions.
[2024-11-08 18:30:42,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8
[2024-11-08 18:30:42,502 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:30:42,503 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions.
[2024-11-08 18:30:42,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:30:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions.
[2024-11-08 18:30:42,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-08 18:30:42,505 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:30:42,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:30:42,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 18:30:42,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:30:42,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:30:42,507 INFO L85 PathProgramCache]: Analyzing trace with hash 176642123, now seen corresponding path program 1 times
[2024-11-08 18:30:42,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:30:42,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566036671]
[2024-11-08 18:30:42,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:30:42,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:30:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:30:42,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 18:30:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:30:42,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 18:30:42,644 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 18:30:42,651 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 18:30:42,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 18:30:42,660 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1]
[2024-11-08 18:30:42,683 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 18:30:42,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:30:42 BoogieIcfgContainer
[2024-11-08 18:30:42,691 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 18:30:42,691 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 18:30:42,692 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 18:30:42,692 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 18:30:42,693 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:30:42" (3/4) ...
[2024-11-08 18:30:42,697 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 18:30:42,699 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 18:30:42,701 INFO L158 Benchmark]: Toolchain (without parser) took 1229.48ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 74.4MB in the end (delta: 49.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB.
[2024-11-08 18:30:42,702 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 104.9MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:30:42,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.23ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 111.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-08 18:30:42,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.64ms. Allocated memory is still 159.4MB. Free memory was 111.4MB in the beginning and 110.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:30:42,708 INFO L158 Benchmark]: Boogie Preprocessor took 37.92ms. Allocated memory is still 159.4MB. Free memory was 110.0MB in the beginning and 108.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 18:30:42,708 INFO L158 Benchmark]: RCFGBuilder took 251.29ms. Allocated memory is still 159.4MB. Free memory was 108.3MB in the beginning and 98.9MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-11-08 18:30:42,709 INFO L158 Benchmark]: TraceAbstraction took 557.47ms. Allocated memory is still 159.4MB. Free memory was 97.9MB in the beginning and 74.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2024-11-08 18:30:42,709 INFO L158 Benchmark]: Witness Printer took 7.51ms. Allocated memory is still 159.4MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:30:42,715 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.26ms. Allocated memory is still 104.9MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 330.23ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 111.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 36.64ms. Allocated memory is still 159.4MB. Free memory was 111.4MB in the beginning and 110.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 37.92ms. Allocated memory is still 159.4MB. Free memory was 110.0MB in the beginning and 108.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 251.29ms. Allocated memory is still 159.4MB. Free memory was 108.3MB in the beginning and 98.9MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 557.47ms. Allocated memory is still 159.4MB. Free memory was 97.9MB in the beginning and 74.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* Witness Printer took 7.51ms. Allocated memory is still 159.4MB. Free memory is still 74.8MB. There was no memory consumed. 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: 16]: 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 someBinaryDOUBLEComparisonOperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 27.
Possible FailurePath:
[L18] double sqrt2 = 1.414213538169860839843750;
VAL [sqrt2=11863283/8388608]
[L22] double S, I;
[L24] I = __VERIFIER_nondet_double()
[L25] CALL assume_abort_if_not(I >= 1. && I <= 3.)
[L14] COND FALSE !(!cond)
VAL [sqrt2=11863283/8388608]
[L25] RET assume_abort_if_not(I >= 1. && I <= 3.)
[L27] COND TRUE I >= 2.
[L27] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.)))
VAL [sqrt2=11863283/8388608]
[L30] CALL __VERIFIER_assert(S >= 1. && S <= 2.)
[L16] COND TRUE !(cond)
VAL [sqrt2=11863283/8388608]
[L16] reach_error()
VAL [sqrt2=11863283/8388608]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 13 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-11-08 18:30:42,760 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:30:45,244 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:30:45,352 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-08 18:30:45,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:30:45,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:30:45,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:30:45,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:30:45,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:30:45,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:30:45,389 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:30:45,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:30:45,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:30:45,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:30:45,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:30:45,391 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:30:45,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:30:45,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 18:30:45,393 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:30:45,393 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:30:45,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:30:45,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 18:30:45,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:30:45,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 18:30:45,395 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 18:30:45,396 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-08 18:30:45,396 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:30:45,396 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 18:30:45,397 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:30:45,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 18:30:45,397 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:30:45,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:30:45,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:30:45,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:30:45,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:30:45,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:30:45,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:30:45,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:30:45,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 18:30:45,401 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-08 18:30:45,401 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 18:30:45,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:30:45,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:30:45,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:30:45,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:30:45,404 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/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.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8
[2024-11-08 18:30:45,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:30:45,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:30:45,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:30:45,797 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:30:45,798 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:30:45,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/float-benchs/sqrt_poly.c
Unable to find full path for "g++"
[2024-11-08 18:30:47,937 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:30:48,180 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:30:48,181 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/sv-benchmarks/c/float-benchs/sqrt_poly.c
[2024-11-08 18:30:48,190 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/data/77dd0249e/4dcfc3a8de56479b9b0b851a69c29ad7/FLAGbbe882e47
[2024-11-08 18:30:48,214 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/data/77dd0249e/4dcfc3a8de56479b9b0b851a69c29ad7
[2024-11-08 18:30:48,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:30:48,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:30:48,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:30:48,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:30:48,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:30:48,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:30:48" (1/1) ...
[2024-11-08 18:30:48,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ef1015f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:48, skipping insertion in model container
[2024-11-08 18:30:48,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:30:48" (1/1) ...
[2024-11-08 18:30:48,264 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:30:48,527 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684]
[2024-11-08 18:30:48,545 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:30:48,566 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:30:48,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684]
[2024-11-08 18:30:48,614 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:30:48,648 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:30:48,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:48 WrapperNode
[2024-11-08 18:30:48,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:30:48,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:30:48,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:30:48,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:30:48,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:48" (1/1) ...
[2024-11-08 18:30:48,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:48" (1/1) ...
[2024-11-08 18:30:48,692 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 32
[2024-11-08 18:30:48,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:30:48,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:30:48,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:30:48,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:30:48,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:48" (1/1) ...
[2024-11-08 18:30:48,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:48" (1/1) ...
[2024-11-08 18:30:48,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:48" (1/1) ...
[2024-11-08 18:30:48,731 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-11-08 18:30:48,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:48" (1/1) ...
[2024-11-08 18:30:48,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:48" (1/1) ...
[2024-11-08 18:30:48,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:48" (1/1) ...
[2024-11-08 18:30:48,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:48" (1/1) ...
[2024-11-08 18:30:48,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:48" (1/1) ...
[2024-11-08 18:30:48,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:48" (1/1) ...
[2024-11-08 18:30:48,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:30:48,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:30:48,762 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:30:48,762 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:30:48,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:48" (1/1) ...
[2024-11-08 18:30:48,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:30:48,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:30:48,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:30:48,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:30:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:30:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 18:30:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:30:48,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:30:48,940 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:30:48,944 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:30:57,377 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live.
[2024-11-08 18:30:57,377 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:30:57,393 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:30:57,393 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 18:30:57,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:30:57 BoogieIcfgContainer
[2024-11-08 18:30:57,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:30:57,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:30:57,397 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:30:57,402 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:30:57,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:30:48" (1/3) ...
[2024-11-08 18:30:57,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18097d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:30:57, skipping insertion in model container
[2024-11-08 18:30:57,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:30:48" (2/3) ...
[2024-11-08 18:30:57,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18097d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:30:57, skipping insertion in model container
[2024-11-08 18:30:57,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:30:57" (3/3) ...
[2024-11-08 18:30:57,406 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c
[2024-11-08 18:30:57,428 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:30:57,429 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 18:30:57,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:30:57,512 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3274db49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:30:57,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 18:30:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:30:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-08 18:30:57,527 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:30:57,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:30:57,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:30:57,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:30:57,538 INFO L85 PathProgramCache]: Analyzing trace with hash 119383821, now seen corresponding path program 1 times
[2024-11-08 18:30:57,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:30:57,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848115096]
[2024-11-08 18:30:57,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:30:57,556 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-11-08 18:30:57,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:30:57,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/mathsat -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-11-08 18:30:57,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/mathsat -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-11-08 18:30:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:30:58,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-08 18:30:58,510 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:30:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:30:58,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:30:58,529 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:30:58,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848115096]
[2024-11-08 18:30:58,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848115096] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:30:58,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:30:58,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 18:30:58,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952387646]
[2024-11-08 18:30:58,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:30:58,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 18:30:58,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:30:58,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 18:30:58,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:30:58,581 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:30:58,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:30:58,593 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions.
[2024-11-08 18:30:58,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 18:30:58,595 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2024-11-08 18:30:58,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:30:58,602 INFO L225 Difference]: With dead ends: 23
[2024-11-08 18:30:58,603 INFO L226 Difference]: Without dead ends: 9
[2024-11-08 18:30:58,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:30:58,611 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:30:58,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:30:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states.
[2024-11-08 18:30:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2024-11-08 18:30:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:30:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions.
[2024-11-08 18:30:58,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8
[2024-11-08 18:30:58,643 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:30:58,643 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions.
[2024-11-08 18:30:58,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:30:58,644 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions.
[2024-11-08 18:30:58,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-08 18:30:58,644 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:30:58,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:30:58,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/mathsat -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-11-08 18:30:58,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/mathsat -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-11-08 18:30:58,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:30:58,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:30:58,847 INFO L85 PathProgramCache]: Analyzing trace with hash 176642123, now seen corresponding path program 1 times
[2024-11-08 18:30:58,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:30:58,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260618117]
[2024-11-08 18:30:58,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:30:58,848 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-11-08 18:30:58,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:30:58,850 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/mathsat -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-11-08 18:30:58,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-08 18:31:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:31:01,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-08 18:31:01,197 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:31:10,472 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:31:23,217 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:31:31,392 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:31:35,529 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (= |c_ULTIMATE.start_main_~S~0#1| (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false
[2024-11-08 18:31:48,130 WARN L286 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:31:56,559 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:32:04,917 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:32:13,270 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:32:30,014 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:32:38,473 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:32:46,727 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:32:59,055 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:33:07,477 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:33:15,866 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:33:20,119 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (and (or (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_7| .cse1) .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse4)))))) .cse3)))) (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_7| .cse1) .cse3))) (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse7)))))) .cse1)) (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_7| .cse1) .cse3))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse9)))))))) (and (fp.geq .cse8 .cse3) (fp.leq .cse8 .cse1) (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) is different from false
[2024-11-08 18:33:32,703 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:33:41,201 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:33:49,428 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:34:01,790 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:34:10,273 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:34:18,710 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:34:22,972 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_7| .cse1) .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse4)))))) .cse3)))) (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_7| .cse1) .cse3))) (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse7)))))) .cse1)) (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1))))) is different from false
[2024-11-08 18:34:27,032 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_7| .cse1) .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse4)))))) .cse3)))) (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_7| .cse1) .cse3))) (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse7)))))) .cse1)) (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1))))) is different from true
[2024-11-08 18:34:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:34:27,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:34:27,033 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:34:27,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260618117]
[2024-11-08 18:34:27,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260618117] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:34:27,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:34:27,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 18:34:27,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709027493]
[2024-11-08 18:34:27,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:34:27,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 18:34:27,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:34:27,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 18:34:27,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=13, Unknown=4, NotChecked=24, Total=56
[2024-11-08 18:34:27,038 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:34:31,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:34:35,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:34:39,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:34:43,959 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)))) (and (exists ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (fp.leq |v_ULTIMATE.start_main_~I~0#1_7| ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (= |c_ULTIMATE.start_main_~S~0#1| (fp.mul c_currentRoundingMode .cse1 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3))))))))))) (= c_~sqrt2~0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2024-11-08 18:34:48,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:34:49,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:34:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:34:49,807 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions.
[2024-11-08 18:34:49,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 18:34:49,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2024-11-08 18:34:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:34:49,809 INFO L225 Difference]: With dead ends: 13
[2024-11-08 18:34:49,809 INFO L226 Difference]: Without dead ends: 9
[2024-11-08 18:34:49,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=17, Invalid=14, Unknown=5, NotChecked=36, Total=72
[2024-11-08 18:34:49,811 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time
[2024-11-08 18:34:49,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 9 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 4 Unknown, 37 Unchecked, 18.5s Time]
[2024-11-08 18:34:49,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states.
[2024-11-08 18:34:49,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2024-11-08 18:34:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:34:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8 transitions.
[2024-11-08 18:34:49,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 8 transitions. Word has length 8
[2024-11-08 18:34:49,815 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:34:49,815 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 8 transitions.
[2024-11-08 18:34:49,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:34:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions.
[2024-11-08 18:34:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-08 18:34:49,816 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:34:49,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:34:49,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-08 18:34:50,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/mathsat -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-11-08 18:34:50,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:34:50,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:34:50,018 INFO L85 PathProgramCache]: Analyzing trace with hash 176701705, now seen corresponding path program 1 times
[2024-11-08 18:34:50,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:34:50,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037763020]
[2024-11-08 18:34:50,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:34:50,019 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-11-08 18:34:50,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:34:50,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/mathsat -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-11-08 18:34:50,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-08 18:35:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:35:41,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-08 18:35:41,961 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:35:52,166 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:36:00,672 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:36:13,586 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:36:17,753 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= |c_ULTIMATE.start_main_~S~0#1| (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false
[2024-11-08 18:36:34,552 WARN L286 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:36:42,983 WARN L286 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:36:51,184 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:37:03,713 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:37:11,927 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:37:20,307 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:37:32,968 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:37:41,494 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:37:49,910 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:37:58,367 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:38:02,786 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse3 .cse6))))))))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (fp.geq .cse1 .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse2)) (fp.leq .cse1 .cse2)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse2)) (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (let ((.cse7 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse7 .cse6))))))) .cse2)))) (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse8 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse8 .cse6))))))) .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse2)))))))) is different from false
[2024-11-08 18:38:15,370 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:38:22,288 WARN L286 SmtUtils]: Spent 6.92s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:38:30,512 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:38:43,059 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:38:51,278 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:38:59,715 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:39:03,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse1)) (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (let ((.cse2 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse2 .cse5))))))) .cse1)))) (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse6 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 .cse5))))))) .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse1)))))) is different from false
[2024-11-08 18:39:07,987 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse1)) (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (let ((.cse2 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse2 .cse5))))))) .cse1)))) (exists ((|v_ULTIMATE.start_main_~I~0#1_8| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse0) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse6 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~I~0#1_8| .cse0))) (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 .cse5))))))) .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_8| .cse1)))))) is different from true
[2024-11-08 18:39:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:39:07,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:39:07,987 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:39:07,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037763020]
[2024-11-08 18:39:07,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037763020] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:39:07,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:39:07,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 18:39:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993017196]
[2024-11-08 18:39:07,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:39:07,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 18:39:07,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:39:07,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 18:39:07,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=13, Unknown=4, NotChecked=24, Total=56
[2024-11-08 18:39:07,991 INFO L87 Difference]: Start difference. First operand 9 states and 8 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:39:12,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:39:16,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:39:20,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 18:39:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:39:20,534 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions.
[2024-11-08 18:39:20,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 18:39:20,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2024-11-08 18:39:20,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:39:20,635 INFO L225 Difference]: With dead ends: 9
[2024-11-08 18:39:20,635 INFO L226 Difference]: Without dead ends: 0
[2024-11-08 18:39:20,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=15, Invalid=13, Unknown=4, NotChecked=24, Total=56
[2024-11-08 18:39:20,637 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time
[2024-11-08 18:39:20,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 3 Unknown, 25 Unchecked, 12.5s Time]
[2024-11-08 18:39:20,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-08 18:39:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-08 18:39:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:39:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-08 18:39:20,640 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8
[2024-11-08 18:39:20,640 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:39:20,640 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-08 18:39:20,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:39:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-08 18:39:20,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-08 18:39:20,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 18:39:20,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2024-11-08 18:39:20,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/mathsat -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-11-08 18:39:20,848 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-11-08 18:39:20,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-08 18:39:20,856 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 18:39:20,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:39:20 BoogieIcfgContainer
[2024-11-08 18:39:20,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 18:39:20,863 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 18:39:20,863 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 18:39:20,863 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 18:39:20,864 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:30:57" (3/4) ...
[2024-11-08 18:39:20,867 INFO L142 WitnessPrinter]: Generating witness for correct program
[2024-11-08 18:39:20,876 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-08 18:39:20,876 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges
[2024-11-08 18:39:20,877 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-08 18:39:20,877 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-08 18:39:20,996 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/witness.graphml
[2024-11-08 18:39:21,001 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/witness.yml
[2024-11-08 18:39:21,001 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 18:39:21,002 INFO L158 Benchmark]: Toolchain (without parser) took 512782.76ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 39.0MB in the beginning and 69.2MB in the end (delta: -30.1MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB.
[2024-11-08 18:39:21,002 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 67.1MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:39:21,003 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.21ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 38.9MB in the beginning and 70.4MB in the end (delta: -31.6MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB.
[2024-11-08 18:39:21,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.88ms. Allocated memory is still 92.3MB. Free memory was 70.4MB in the beginning and 68.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 18:39:21,004 INFO L158 Benchmark]: Boogie Preprocessor took 63.17ms. Allocated memory is still 92.3MB. Free memory was 68.7MB in the beginning and 66.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 18:39:21,004 INFO L158 Benchmark]: RCFGBuilder took 8633.61ms. Allocated memory is still 92.3MB. Free memory was 66.7MB in the beginning and 56.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-11-08 18:39:21,004 INFO L158 Benchmark]: TraceAbstraction took 503465.44ms. Allocated memory is still 92.3MB. Free memory was 55.8MB in the beginning and 55.2MB in the end (delta: 663.3kB). Peak memory consumption was 247.4kB. Max. memory is 16.1GB.
[2024-11-08 18:39:21,005 INFO L158 Benchmark]: Witness Printer took 138.19ms. Allocated memory is still 92.3MB. Free memory was 55.2MB in the beginning and 69.2MB in the end (delta: -14.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-08 18:39:21,011 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.23ms. Allocated memory is still 67.1MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 428.21ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 38.9MB in the beginning and 70.4MB in the end (delta: -31.6MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 42.88ms. Allocated memory is still 92.3MB. Free memory was 70.4MB in the beginning and 68.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 63.17ms. Allocated memory is still 92.3MB. Free memory was 68.7MB in the beginning and 66.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 8633.61ms. Allocated memory is still 92.3MB. Free memory was 66.7MB in the beginning and 56.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 503465.44ms. Allocated memory is still 92.3MB. Free memory was 55.8MB in the beginning and 55.2MB in the end (delta: 663.3kB). Peak memory consumption was 247.4kB. Max. memory is 16.1GB.
* Witness Printer took 138.19ms. Allocated memory is still 92.3MB. Free memory was 55.2MB in the beginning and 69.2MB in the end (delta: -14.0MB). Peak memory consumption was 6.3MB. 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
- PositiveResult [Line: 16]: a call to reach_error is unreachable
For all program executions holds that a call to reach_error is unreachable at this location
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 503.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 35.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 31.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 30.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 62 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 19 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 55.0s SatisfiabilityAnalysisTime, 412.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 6 QuantifiedInterpolants, 1011 SizeOfPredicates, 3 NumberOfNonLiveVariables, 72 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2024-11-08 18:39:21,243 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process
[2024-11-08 18:39:21,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_173dd695-81f6-4855-9bcc-06f67863538e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE