./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.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_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:50:34,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:50:34,785 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 04:50:34,792 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:50:34,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:50:34,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:50:34,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:50:34,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:50:34,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:50:34,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:50:34,833 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:50:34,833 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:50:34,834 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:50:34,834 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:50:34,835 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:50:34,835 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:50:34,835 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:50:34,836 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:50:34,836 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:50:34,837 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:50:34,837 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:50:34,841 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:50:34,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:50:34,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:50:34,843 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:50:34,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:50:34,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:50:34,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:50:34,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:50:34,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:50:34,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:50:34,848 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:50:34,849 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:50:34,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:50:34,849 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:50:34,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:50:34,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:50:34,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:50:34,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:50:34,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:50:34,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:50:34,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:50:34,853 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:50:34,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:50:34,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:50:34,855 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:50:34,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:50:34,855 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/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_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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 -> f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 [2024-11-09 04:50:35,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:50:35,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:50:35,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:50:35,199 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:50:35,200 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:50:35,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c Unable to find full path for "g++" [2024-11-09 04:50:37,207 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:50:37,426 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:50:37,427 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-11-09 04:50:37,439 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/data/a011a18e8/d318e112b5714ff6aab531e76f1230cd/FLAG478c8b501 [2024-11-09 04:50:37,457 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/data/a011a18e8/d318e112b5714ff6aab531e76f1230cd [2024-11-09 04:50:37,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:50:37,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:50:37,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:50:37,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:50:37,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:50:37,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:50:37" (1/1) ... [2024-11-09 04:50:37,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45997188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:37, skipping insertion in model container [2024-11-09 04:50:37,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:50:37" (1/1) ... [2024-11-09 04:50:37,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:50:37,763 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_b3673a65-9415-46a1-8d7c-b33666173dc3/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-11-09 04:50:37,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:50:37,782 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:50:37,803 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_b3673a65-9415-46a1-8d7c-b33666173dc3/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-11-09 04:50:37,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:50:37,827 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:50:37,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:37 WrapperNode [2024-11-09 04:50:37,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:50:37,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:50:37,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:50:37,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:50:37,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:37" (1/1) ... [2024-11-09 04:50:37,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:37" (1/1) ... [2024-11-09 04:50:37,864 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 110 [2024-11-09 04:50:37,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:50:37,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:50:37,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:50:37,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:50:37,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:37" (1/1) ... [2024-11-09 04:50:37,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:37" (1/1) ... [2024-11-09 04:50:37,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:37" (1/1) ... [2024-11-09 04:50:37,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:37" (1/1) ... [2024-11-09 04:50:37,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:37" (1/1) ... [2024-11-09 04:50:37,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:37" (1/1) ... [2024-11-09 04:50:37,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:37" (1/1) ... [2024-11-09 04:50:37,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:37" (1/1) ... [2024-11-09 04:50:37,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:50:37,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:50:37,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:50:37,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:50:37,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:37" (1/1) ... [2024-11-09 04:50:37,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:50:37,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:50:37,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:50:37,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:50:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:50:37,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:50:37,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:50:37,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 04:50:37,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:50:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 04:50:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:50:37,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:50:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 04:50:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:50:38,088 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:50:38,094 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:50:38,304 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-09 04:50:38,304 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:50:38,418 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:50:38,418 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:50:38,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:50:38 BoogieIcfgContainer [2024-11-09 04:50:38,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:50:38,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:50:38,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:50:38,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:50:38,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:50:37" (1/3) ... [2024-11-09 04:50:38,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c16b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:50:38, skipping insertion in model container [2024-11-09 04:50:38,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:37" (2/3) ... [2024-11-09 04:50:38,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c16b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:50:38, skipping insertion in model container [2024-11-09 04:50:38,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:50:38" (3/3) ... [2024-11-09 04:50:38,433 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2024-11-09 04:50:38,457 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:50:38,458 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:50:38,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:50:38,541 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=FINITE_AUTOMATA, 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;@1608e2dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:50:38,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:50:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 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-09 04:50:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 04:50:38,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:50:38,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:50:38,554 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:50:38,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:50:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash 127721931, now seen corresponding path program 1 times [2024-11-09 04:50:38,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:50:38,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795130318] [2024-11-09 04:50:38,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:50:38,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:50:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:50:39,003 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-09 04:50:39,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:50:39,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795130318] [2024-11-09 04:50:39,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795130318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:50:39,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:50:39,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:50:39,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862694311] [2024-11-09 04:50:39,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:50:39,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:50:39,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:50:39,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:50:39,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:50:39,060 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 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 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-09 04:50:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:50:39,119 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2024-11-09 04:50:39,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:50:39,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-09 04:50:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:50:39,131 INFO L225 Difference]: With dead ends: 30 [2024-11-09 04:50:39,132 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 04:50:39,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:50:39,137 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:50:39,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:50:39,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 04:50:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-09 04:50:39,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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-09 04:50:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-11-09 04:50:39,174 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 10 [2024-11-09 04:50:39,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:50:39,175 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-09 04:50:39,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-09 04:50:39,175 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2024-11-09 04:50:39,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 04:50:39,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:50:39,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:50:39,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:50:39,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:50:39,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:50:39,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1109979824, now seen corresponding path program 1 times [2024-11-09 04:50:39,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:50:39,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531649388] [2024-11-09 04:50:39,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:50:39,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:50:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:50:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:50:39,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:50:39,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531649388] [2024-11-09 04:50:39,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531649388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:50:39,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:50:39,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:50:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728006533] [2024-11-09 04:50:39,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:50:39,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:50:39,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:50:39,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:50:39,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:50:39,336 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-09 04:50:39,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:50:39,375 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-11-09 04:50:39,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:50:39,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2024-11-09 04:50:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:50:39,377 INFO L225 Difference]: With dead ends: 28 [2024-11-09 04:50:39,378 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 04:50:39,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:50:39,380 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:50:39,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:50:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 04:50:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-11-09 04:50:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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-09 04:50:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-11-09 04:50:39,385 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 [2024-11-09 04:50:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:50:39,386 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-09 04:50:39,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-09 04:50:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-11-09 04:50:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 04:50:39,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:50:39,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:50:39,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:50:39,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:50:39,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:50:39,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1655578765, now seen corresponding path program 1 times [2024-11-09 04:50:39,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:50:39,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882168549] [2024-11-09 04:50:39,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:50:39,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:50:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:50:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 04:50:39,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:50:39,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882168549] [2024-11-09 04:50:39,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882168549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:50:39,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:50:39,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:50:39,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414861029] [2024-11-09 04:50:39,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:50:39,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:50:39,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:50:39,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:50:39,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:50:39,574 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-09 04:50:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:50:39,614 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-11-09 04:50:39,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:50:39,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2024-11-09 04:50:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:50:39,616 INFO L225 Difference]: With dead ends: 24 [2024-11-09 04:50:39,616 INFO L226 Difference]: Without dead ends: 20 [2024-11-09 04:50:39,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:50:39,618 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:50:39,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:50:39,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-09 04:50:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-11-09 04:50:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-09 04:50:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2024-11-09 04:50:39,622 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 14 [2024-11-09 04:50:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:50:39,623 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-11-09 04:50:39,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-09 04:50:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2024-11-09 04:50:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 04:50:39,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:50:39,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:50:39,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 04:50:39,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:50:39,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:50:39,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1672589426, now seen corresponding path program 1 times [2024-11-09 04:50:39,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:50:39,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34738841] [2024-11-09 04:50:39,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:50:39,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:50:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:50:39,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 04:50:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:50:39,715 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 04:50:39,716 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 04:50:39,718 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 04:50:39,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 04:50:39,724 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 04:50:39,754 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 04:50:39,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:50:39 BoogieIcfgContainer [2024-11-09 04:50:39,762 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 04:50:39,763 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 04:50:39,763 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 04:50:39,763 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 04:50:39,764 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:50:38" (3/4) ... [2024-11-09 04:50:39,771 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 04:50:39,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 04:50:39,774 INFO L158 Benchmark]: Toolchain (without parser) took 2310.66ms. Allocated memory was 144.7MB in the beginning and 180.4MB in the end (delta: 35.7MB). Free memory was 104.0MB in the beginning and 102.9MB in the end (delta: 1.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-09 04:50:39,776 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 144.7MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:50:39,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.83ms. Allocated memory is still 144.7MB. Free memory was 103.8MB in the beginning and 90.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 04:50:39,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.82ms. Allocated memory is still 144.7MB. Free memory was 90.3MB in the beginning and 88.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:50:39,781 INFO L158 Benchmark]: Boogie Preprocessor took 40.28ms. Allocated memory is still 144.7MB. Free memory was 88.7MB in the beginning and 87.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:50:39,782 INFO L158 Benchmark]: RCFGBuilder took 514.27ms. Allocated memory is still 144.7MB. Free memory was 87.2MB in the beginning and 70.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 04:50:39,784 INFO L158 Benchmark]: TraceAbstraction took 1339.26ms. Allocated memory was 144.7MB in the beginning and 180.4MB in the end (delta: 35.7MB). Free memory was 69.8MB in the beginning and 102.9MB in the end (delta: -33.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 04:50:39,784 INFO L158 Benchmark]: Witness Printer took 10.39ms. Allocated memory is still 180.4MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:50:39,786 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.30ms. Allocated memory is still 144.7MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.83ms. Allocated memory is still 144.7MB. Free memory was 103.8MB in the beginning and 90.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.82ms. Allocated memory is still 144.7MB. Free memory was 90.3MB in the beginning and 88.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.28ms. Allocated memory is still 144.7MB. Free memory was 88.7MB in the beginning and 87.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 514.27ms. Allocated memory is still 144.7MB. Free memory was 87.2MB in the beginning and 70.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1339.26ms. Allocated memory was 144.7MB in the beginning and 180.4MB in the end (delta: 35.7MB). Free memory was 69.8MB in the beginning and 102.9MB in the end (delta: -33.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Witness Printer took 10.39ms. Allocated memory is still 180.4MB. Free memory is still 102.9MB. 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: 96]: 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 bitwiseAnd at line 45, overapproximation of someBinaryArithmeticDOUBLEoperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of to_real at line 46. Possible FailurePath: [L1] int __return_main; [L17] double __return_104; [L20] double main__a; [L21] double main__r; [L22] main__a = __VERIFIER_nondet_double() [L23] int main____CPAchecker_TMP_0; VAL [__return_104=0, __return_main=0] [L24] COND TRUE main__a >= 20.0 VAL [__return_104=0, __return_main=0] [L26] COND TRUE main__a <= 30.0 [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_104=0, __return_main=0, main____CPAchecker_TMP_0=1] [L30] COND TRUE main____CPAchecker_TMP_0 != 0 [L33] double __tmp_1; [L34] __tmp_1 = main__a [L35] double inv__A; [L36] inv__A = __tmp_1 [L37] double inv__xi; [L38] double inv__xsi; [L39] double inv__temp; [L40] signed int inv__cond; [L41] signed int inv__exp; [L42] union double_int inv__A_u; [L43] union double_int inv__xi_u; [L44] inv__A_u.d = inv__A [L45] EXPR inv__A_u.i [L45] EXPR (inv__A_u.i) & 2146435072 [L45] inv__exp = ((signed int)(((inv__A_u.i) & 2146435072) >> 20)) - 1023 [L46] inv__xi_u.d = 1 [L47] inv__xi_u.i = (1023 - inv__exp) << 20 [L48] EXPR inv__xi_u.d [L48] inv__xi = inv__xi_u.d [L49] inv__cond = 1 VAL [__return_104=0, __return_main=0, inv__cond=1, inv__xi=2146435086] [L51] COND TRUE !(inv__cond == 0) [L53] inv__xsi = (2 * inv__xi) - ((inv__A * inv__xi) * inv__xi) [L54] inv__temp = inv__xsi - inv__xi [L55] int inv____CPAchecker_TMP_0; VAL [__return_104=0, __return_main=0, inv__xi=2146435086] [L56] COND FALSE !(inv__temp > 1.0E-10) VAL [__return_104=0, __return_main=0, inv__xi=2146435086] [L67] COND FALSE !(inv__temp < -1.0E-10) [L73] inv____CPAchecker_TMP_0 = 0 VAL [__return_104=0, __return_main=0, inv____CPAchecker_TMP_0=0, inv__xi=2146435086] [L61] inv__cond = inv____CPAchecker_TMP_0 [L62] inv__xi = inv__xsi VAL [__return_104=0, __return_main=0, inv__cond=0, inv__xi=2146435084] [L51] COND FALSE !(!(inv__cond == 0)) [L80] __return_104 = inv__xi [L81] main__r = __return_104 [L82] int main____CPAchecker_TMP_1; VAL [__return_104=2146435084, __return_main=0] [L83] COND FALSE !(main__r >= 0) VAL [__return_104=2146435084, __return_main=0] [L108] main____CPAchecker_TMP_1 = 0 VAL [__return_104=2146435084, __return_main=0, main____CPAchecker_TMP_1=0] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_1 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [__VERIFIER_assert__cond=0, __return_104=2146435084, __return_main=0] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_104=2146435084, __return_main=0] [L96] reach_error() VAL [__return_104=2146435084, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 206 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 61 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 56 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 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-09 04:50:39,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:50:42,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:50:42,430 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 04:50:42,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:50:42,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:50:42,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:50:42,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:50:42,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:50:42,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:50:42,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:50:42,484 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:50:42,485 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:50:42,485 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:50:42,490 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:50:42,490 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:50:42,491 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:50:42,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:50:42,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:50:42,492 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:50:42,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:50:42,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:50:42,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:50:42,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:50:42,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:50:42,495 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:50:42,496 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 04:50:42,496 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:50:42,496 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 04:50:42,497 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:50:42,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:50:42,497 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:50:42,497 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:50:42,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 04:50:42,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:50:42,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:50:42,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:50:42,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:50:42,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:50:42,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:50:42,500 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 04:50:42,500 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 04:50:42,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:50:42,502 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:50:42,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/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_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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 -> f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 [2024-11-09 04:50:42,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:50:42,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:50:42,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:50:42,963 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:50:42,964 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:50:42,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c Unable to find full path for "g++" [2024-11-09 04:50:45,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:50:45,414 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:50:45,415 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-11-09 04:50:45,426 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/data/129b6b1b8/223ced0a245c44a7bf8e25c4cabed152/FLAG88dbe12d8 [2024-11-09 04:50:45,447 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/data/129b6b1b8/223ced0a245c44a7bf8e25c4cabed152 [2024-11-09 04:50:45,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:50:45,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:50:45,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:50:45,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:50:45,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:50:45,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:50:45" (1/1) ... [2024-11-09 04:50:45,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb557c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:45, skipping insertion in model container [2024-11-09 04:50:45,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:50:45" (1/1) ... [2024-11-09 04:50:45,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:50:45,766 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_b3673a65-9415-46a1-8d7c-b33666173dc3/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-11-09 04:50:45,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:50:45,792 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:50:45,827 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_b3673a65-9415-46a1-8d7c-b33666173dc3/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-11-09 04:50:45,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:50:45,856 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:50:45,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:45 WrapperNode [2024-11-09 04:50:45,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:50:45,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:50:45,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:50:45,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:50:45,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:45" (1/1) ... [2024-11-09 04:50:45,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:45" (1/1) ... [2024-11-09 04:50:45,939 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 103 [2024-11-09 04:50:45,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:50:45,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:50:45,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:50:45,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:50:45,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:45" (1/1) ... [2024-11-09 04:50:45,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:45" (1/1) ... [2024-11-09 04:50:45,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:45" (1/1) ... [2024-11-09 04:50:45,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:45" (1/1) ... [2024-11-09 04:50:45,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:45" (1/1) ... [2024-11-09 04:50:45,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:45" (1/1) ... [2024-11-09 04:50:45,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:45" (1/1) ... [2024-11-09 04:50:45,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:45" (1/1) ... [2024-11-09 04:50:45,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:50:45,995 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:50:45,995 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:50:45,995 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:50:45,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:45" (1/1) ... [2024-11-09 04:50:46,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:50:46,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:50:46,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:50:46,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:50:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:50:46,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-09 04:50:46,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-09 04:50:46,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 04:50:46,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:50:46,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 04:50:46,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:50:46,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:50:46,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:50:46,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 04:50:46,184 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:50:46,189 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:50:48,663 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-09 04:50:48,664 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:50:48,683 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:50:48,683 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:50:48,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:50:48 BoogieIcfgContainer [2024-11-09 04:50:48,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:50:48,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:50:48,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:50:48,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:50:48,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:50:45" (1/3) ... [2024-11-09 04:50:48,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8402ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:50:48, skipping insertion in model container [2024-11-09 04:50:48,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:45" (2/3) ... [2024-11-09 04:50:48,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8402ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:50:48, skipping insertion in model container [2024-11-09 04:50:48,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:50:48" (3/3) ... [2024-11-09 04:50:48,700 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2024-11-09 04:50:48,721 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:50:48,721 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:50:48,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:50:48,808 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=FINITE_AUTOMATA, 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;@7c11afad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:50:48,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:50:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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-09 04:50:48,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 04:50:48,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:50:48,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:50:48,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:50:48,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:50:48,841 INFO L85 PathProgramCache]: Analyzing trace with hash -938930996, now seen corresponding path program 1 times [2024-11-09 04:50:48,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:50:48,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816842247] [2024-11-09 04:50:48,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:50:48,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:50:48,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:50:48,862 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/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-09 04:50:48,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/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-09 04:50:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:50:49,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 04:50:49,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:50:49,093 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-09 04:50:49,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:50:49,095 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:50:49,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816842247] [2024-11-09 04:50:49,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816842247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:50:49,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:50:49,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:50:49,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361448974] [2024-11-09 04:50:49,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:50:49,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:50:49,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:50:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:50:49,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:50:49,138 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-09 04:50:51,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:50:53,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:50:55,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:50:55,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:50:55,690 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2024-11-09 04:50:55,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:50:55,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-09 04:50:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:50:55,776 INFO L225 Difference]: With dead ends: 32 [2024-11-09 04:50:55,776 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 04:50:55,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:50:55,784 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:50:55,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 3 Unknown, 0 Unchecked, 6.5s Time] [2024-11-09 04:50:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 04:50:55,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 04:50:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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-09 04:50:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-11-09 04:50:55,829 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2024-11-09 04:50:55,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:50:55,829 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-09 04:50:55,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-09 04:50:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-11-09 04:50:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 04:50:55,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:50:55,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:50:55,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/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-09 04:50:56,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/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-09 04:50:56,035 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:50:56,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:50:56,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1250925041, now seen corresponding path program 1 times [2024-11-09 04:50:56,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:50:56,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853648433] [2024-11-09 04:50:56,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:50:56,038 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-09 04:50:56,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:50:56,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/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-09 04:50:56,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/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-09 04:50:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:50:56,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 04:50:56,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:50:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:50:57,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:50:57,146 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:50:57,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853648433] [2024-11-09 04:50:57,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853648433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:50:57,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:50:57,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:50:57,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451435702] [2024-11-09 04:50:57,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:50:57,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:50:57,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:50:57,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:50:57,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:50:57,154 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-09 04:50:59,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:51:01,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:51:03,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:51:05,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:51:07,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:51:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:51:07,622 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-11-09 04:51:07,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:51:07,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) Word has length 15 [2024-11-09 04:51:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:51:07,681 INFO L225 Difference]: With dead ends: 28 [2024-11-09 04:51:07,681 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 04:51:07,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:51:07,683 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:51:07,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 5 Unknown, 0 Unchecked, 10.5s Time] [2024-11-09 04:51:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 04:51:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-09 04:51:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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-09 04:51:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-11-09 04:51:07,689 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 15 [2024-11-09 04:51:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:51:07,690 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-09 04:51:07,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-09 04:51:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-11-09 04:51:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 04:51:07,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:51:07,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:51:07,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/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-09 04:51:07,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/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-09 04:51:07,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:51:07,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:51:07,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1796523982, now seen corresponding path program 1 times [2024-11-09 04:51:07,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:51:07,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74905346] [2024-11-09 04:51:07,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:51:07,898 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-09 04:51:07,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:51:07,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/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-09 04:51:07,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/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-09 04:51:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:51:08,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 04:51:08,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:51:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 04:51:08,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:51:08,700 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:51:08,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74905346] [2024-11-09 04:51:08,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74905346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:51:08,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:51:08,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:51:08,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314119648] [2024-11-09 04:51:08,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:51:08,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:51:08,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:51:08,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:51:08,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:51:08,706 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-09 04:51:08,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:51:08,785 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-11-09 04:51:08,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:51:08,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) Word has length 15 [2024-11-09 04:51:08,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:51:08,788 INFO L225 Difference]: With dead ends: 24 [2024-11-09 04:51:08,788 INFO L226 Difference]: Without dead ends: 20 [2024-11-09 04:51:08,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:51:08,791 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:51:08,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:51:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-09 04:51:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-09 04:51:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-09 04:51:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-09 04:51:08,798 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2024-11-09 04:51:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:51:08,798 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-09 04:51:08,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-09 04:51:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-11-09 04:51:08,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 04:51:08,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:51:08,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:51:08,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/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-09 04:51:09,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/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-09 04:51:09,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:51:09,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:51:09,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1813534643, now seen corresponding path program 1 times [2024-11-09 04:51:09,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:51:09,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20044711] [2024-11-09 04:51:09,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:51:09,002 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-09 04:51:09,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:51:09,005 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/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-09 04:51:09,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 04:51:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:51:11,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 04:51:11,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:51:35,521 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|))) (= |c_ULTIMATE.start_main_~inv__xsi~0#1| (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0) |c_ULTIMATE.start_main_~inv__temp~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 04:51:58,772 WARN L851 $PredicateComparison]: unable to prove that (and (not (fp.gt |c_ULTIMATE.start_main_~inv__temp~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|))) (= |c_ULTIMATE.start_main_~inv__xsi~0#1| (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0) |c_ULTIMATE.start_main_~inv__temp~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 04:52:26,408 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (fp.lt .cse0 (fp.neg .cse1))) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|))) (not (fp.gt .cse0 .cse1)) (= |c_ULTIMATE.start_main_~inv__xsi~0#1| (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse2) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse2) .cse2))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 04:52:54,068 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (= |c_ULTIMATE.start_main_~inv__xi~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (fp.gt .cse0 .cse1)) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 04:53:21,965 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (fp.gt .cse0 .cse1)) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= .cse2 |c_ULTIMATE.start_main_~main__r~0#1|)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 04:53:50,046 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~inv__A~0#1| .cse1) .cse1)))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 20.0)))))) is different from false [2024-11-09 04:53:52,092 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~inv__A~0#1| .cse1) .cse1)))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 20.0)))))) is different from true [2024-11-09 04:55:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 04:55:02,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:55:18,869 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~inv__A~0#1| |c_ULTIMATE.start_main_~inv__xi~0#1|) |c_ULTIMATE.start_main_~inv__xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~inv__xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.gt .cse0 .cse1) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt .cse0 (fp.neg .cse1))))) is different from false [2024-11-09 04:55:20,944 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~inv__A~0#1| |c_ULTIMATE.start_main_~inv__xi~0#1|) |c_ULTIMATE.start_main_~inv__xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~inv__xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.gt .cse0 .cse1) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt .cse0 (fp.neg .cse1))))) is different from true [2024-11-09 04:55:40,596 WARN L873 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__a~0#1| .cse3) .cse3)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (fp.gt .cse0 .cse1)))))) is different from true [2024-11-09 04:55:59,816 WARN L873 $PredicateComparison]: unable to prove that (or (forall ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__a~0#1| .cse3) .cse3)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (fp.gt .cse0 .cse1)))))) (not (fp.leq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)))) is different from true [2024-11-09 04:56:19,097 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__a~0#1| (_ FloatingPoint 11 53))) (or (not (fp.leq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (forall ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~main__a~0#1| .cse3) .cse3)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt .cse1 (fp.neg .cse2)) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (fp.gt .cse1 .cse2)))))) (not (fp.geq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))))) is different from false [2024-11-09 04:56:21,164 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__a~0#1| (_ FloatingPoint 11 53))) (or (not (fp.leq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (forall ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~main__a~0#1| .cse3) .cse3)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt .cse1 (fp.neg .cse2)) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (fp.gt .cse1 .cse2)))))) (not (fp.geq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))))) is different from true [2024-11-09 04:56:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 04:56:38,294 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:56:38,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20044711] [2024-11-09 04:56:38,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20044711] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:56:38,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1380012909] [2024-11-09 04:56:38,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:56:38,295 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:56:38,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:56:38,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:56:38,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-09 04:56:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:56:40,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 04:56:40,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 05:00:17,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:00:50,344 WARN L873 $PredicateComparison]: unable to prove that (or (forall ((v_skolemized_v_prenex_1_9 (_ BitVec 64))) (not (= |c_ULTIMATE.start_main_~main__a~0#1| (fp ((_ extract 63 63) v_skolemized_v_prenex_1_9) ((_ extract 62 52) v_skolemized_v_prenex_1_9) ((_ extract 51 0) v_skolemized_v_prenex_1_9))))) (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_13| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_13|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__a~0#1| .cse3) .cse3)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse0 .cse1) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))))))))) is different from true [2024-11-09 05:01:09,694 WARN L873 $PredicateComparison]: unable to prove that (or (forall ((v_skolemized_v_prenex_1_9 (_ BitVec 64))) (not (= |c_ULTIMATE.start_main_~main__a~0#1| (fp ((_ extract 63 63) v_skolemized_v_prenex_1_9) ((_ extract 62 52) v_skolemized_v_prenex_1_9) ((_ extract 51 0) v_skolemized_v_prenex_1_9))))) (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_13| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_13|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__a~0#1| .cse3) .cse3)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse0 .cse1) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))))))) (not (fp.leq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)))) is different from true [2024-11-09 05:01:37,725 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_1_9 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_13| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_9) ((_ extract 62 52) v_skolemized_v_prenex_1_9) ((_ extract 51 0) v_skolemized_v_prenex_1_9))) (.cse4 (let ((.cse5 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_13|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse4)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse1 .cse2) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))) (not (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (not (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (fp.lt .cse1 (fp.neg .cse2))))))) is different from false [2024-11-09 05:01:39,805 WARN L873 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_1_9 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_13| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_9) ((_ extract 62 52) v_skolemized_v_prenex_1_9) ((_ extract 51 0) v_skolemized_v_prenex_1_9))) (.cse4 (let ((.cse5 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_13|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse4)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse1 .cse2) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))) (not (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (not (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (fp.lt .cse1 (fp.neg .cse2))))))) is different from true [2024-11-09 05:02:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 05:02:05,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1380012909] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:02:05,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632032198] [2024-11-09 05:02:05,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:05,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:02:05,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:02:05,737 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:02:05,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3673a65-9415-46a1-8d7c-b33666173dc3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 05:02:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:30,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 05:02:30,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:56,713 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_skolemized_q#valueAsBitvector_12| (_ BitVec 64)) (v_skolemized_v_prenex_1_11 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_11) ((_ extract 62 52) v_skolemized_v_prenex_1_11) ((_ extract 51 0) v_skolemized_v_prenex_1_11))) (.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_12|) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) v_skolemized_v_prenex_1_11) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_12|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_12|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_12|))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse1) |c_ULTIMATE.start_main_~inv__temp~0#1|) (= |c_ULTIMATE.start_main_~inv__xsi~0#1| (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse1)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 05:03:41,979 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_skolemized_q#valueAsBitvector_12| (_ BitVec 64)) (v_skolemized_v_prenex_1_11 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_11) ((_ extract 62 52) v_skolemized_v_prenex_1_11) ((_ extract 51 0) v_skolemized_v_prenex_1_11))) (.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_12|) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) v_skolemized_v_prenex_1_11) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (not (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))))) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_12|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_12|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_12|))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= |c_ULTIMATE.start_main_~inv__xsi~0#1| (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse1)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 05:04:05,654 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_skolemized_q#valueAsBitvector_12| (_ BitVec 64)) (v_skolemized_v_prenex_1_11 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_11) ((_ extract 62 52) v_skolemized_v_prenex_1_11) ((_ extract 51 0) v_skolemized_v_prenex_1_11))) (.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_12|) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) v_skolemized_v_prenex_1_11) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_12|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_12|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_12|))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= |c_ULTIMATE.start_main_~inv__xi~0#1| (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse1))) (not (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xi~0#1| .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 05:04:29,412 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_skolemized_q#valueAsBitvector_12| (_ BitVec 64)) (v_skolemized_v_prenex_1_11 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_11) ((_ extract 62 52) v_skolemized_v_prenex_1_11) ((_ extract 51 0) v_skolemized_v_prenex_1_11))) (.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_12|) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) v_skolemized_v_prenex_1_11) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse2) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse2) .cse2)))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_12|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_12|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_12|))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (fp.lt (fp.sub c_currentRoundingMode .cse1 .cse2) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))))) (= .cse1 |c_ULTIMATE.start_main_~main__r~0#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 05:04:55,293 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_12| (_ BitVec 64)) (v_skolemized_v_prenex_1_11 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_11) ((_ extract 62 52) v_skolemized_v_prenex_1_11) ((_ extract 51 0) v_skolemized_v_prenex_1_11))) (.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_12|) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) v_skolemized_v_prenex_1_11) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse2) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse2) .cse2)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_12|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_12|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_12|))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (not (fp.lt (fp.sub roundNearestTiesToEven .cse1 .cse2) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (not (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) is different from false [2024-11-09 05:04:57,361 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_12| (_ BitVec 64)) (v_skolemized_v_prenex_1_11 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_11) ((_ extract 62 52) v_skolemized_v_prenex_1_11) ((_ extract 51 0) v_skolemized_v_prenex_1_11))) (.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_12|) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) v_skolemized_v_prenex_1_11) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse2) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse2) .cse2)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_12|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_12|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_12|))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (not (fp.lt (fp.sub roundNearestTiesToEven .cse1 .cse2) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (not (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) is different from true