./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/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_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:14:47,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:14:47,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:14:47,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:14:47,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:14:47,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:14:47,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:14:47,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:14:47,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:14:47,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:14:47,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:14:47,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:14:47,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:14:47,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:14:47,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:14:47,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:14:47,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:14:47,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:14:47,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:14:47,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:14:47,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:14:47,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:14:47,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:14:47,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:14:47,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:14:47,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:14:47,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:14:47,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:14:47,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:14:47,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:14:47,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:14:47,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:14:47,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:14:47,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:14:47,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:14:47,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:14:47,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:14:47,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:14:47,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:14:47,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:14:47,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:14:47,972 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:14:48,002 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:14:48,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:14:48,003 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:14:48,003 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:14:48,004 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:14:48,005 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:14:48,005 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:14:48,005 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:14:48,006 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:14:48,006 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:14:48,006 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:14:48,007 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:14:48,007 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:14:48,007 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:14:48,008 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:14:48,008 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:14:48,008 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:14:48,008 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:14:48,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:14:48,010 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:14:48,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:14:48,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:14:48,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:14:48,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:14:48,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:14:48,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:14:48,012 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:14:48,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:14:48,013 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:14:48,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:14:48,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:14:48,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:14:48,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:14:48,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:14:48,015 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:14:48,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:14:48,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:14:48,016 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:14:48,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:14:48,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:14:48,016 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:14:48,017 INFO L138 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_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/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_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2022-11-03 02:14:48,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:14:48,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:14:48,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:14:48,444 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:14:48,447 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:14:48,449 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2022-11-03 02:14:48,541 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/data/58e64a000/8eb842793e7e4acea8fd7491f7b8a0e2/FLAG8a1d84bad [2022-11-03 02:14:49,214 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:14:49,215 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2022-11-03 02:14:49,228 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/data/58e64a000/8eb842793e7e4acea8fd7491f7b8a0e2/FLAG8a1d84bad [2022-11-03 02:14:49,568 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/data/58e64a000/8eb842793e7e4acea8fd7491f7b8a0e2 [2022-11-03 02:14:49,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:14:49,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:14:49,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:14:49,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:14:49,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:14:49,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:14:49" (1/1) ... [2022-11-03 02:14:49,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d33fb5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:49, skipping insertion in model container [2022-11-03 02:14:49,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:14:49" (1/1) ... [2022-11-03 02:14:49,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:14:49,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:14:49,961 WARN L230 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_f7f53027-773c-4289-8b38-b22089d2ea6f/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2022-11-03 02:14:49,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:14:49,988 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:14:50,034 WARN L230 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_f7f53027-773c-4289-8b38-b22089d2ea6f/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2022-11-03 02:14:50,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:14:50,064 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:14:50,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:50 WrapperNode [2022-11-03 02:14:50,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:14:50,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:14:50,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:14:50,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:14:50,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:50" (1/1) ... [2022-11-03 02:14:50,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:50" (1/1) ... [2022-11-03 02:14:50,137 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 98 [2022-11-03 02:14:50,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:14:50,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:14:50,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:14:50,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:14:50,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:50" (1/1) ... [2022-11-03 02:14:50,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:50" (1/1) ... [2022-11-03 02:14:50,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:50" (1/1) ... [2022-11-03 02:14:50,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:50" (1/1) ... [2022-11-03 02:14:50,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:50" (1/1) ... [2022-11-03 02:14:50,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:50" (1/1) ... [2022-11-03 02:14:50,193 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:50" (1/1) ... [2022-11-03 02:14:50,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:50" (1/1) ... [2022-11-03 02:14:50,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:14:50,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:14:50,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:14:50,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:14:50,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:50" (1/1) ... [2022-11-03 02:14:50,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:14:50,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:50,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:14:50,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:14:50,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:14:50,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:14:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:14:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-03 02:14:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:14:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-11-03 02:14:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:14:50,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:14:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:14:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:14:50,444 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:14:50,447 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:14:50,718 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:14:50,747 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:14:50,747 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 02:14:50,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:14:50 BoogieIcfgContainer [2022-11-03 02:14:50,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:14:50,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:14:50,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:14:50,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:14:50,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:14:49" (1/3) ... [2022-11-03 02:14:50,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3463b5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:14:50, skipping insertion in model container [2022-11-03 02:14:50,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:50" (2/3) ... [2022-11-03 02:14:50,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3463b5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:14:50, skipping insertion in model container [2022-11-03 02:14:50,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:14:50" (3/3) ... [2022-11-03 02:14:50,773 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2022-11-03 02:14:50,812 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:14:50,813 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:14:50,886 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:14:50,895 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@58adf75f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:14:50,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:14:50,901 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) [2022-11-03 02:14:50,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:14:50,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:50,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:50,916 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:14:50,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:50,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1934553295, now seen corresponding path program 1 times [2022-11-03 02:14:50,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:50,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937832239] [2022-11-03 02:14:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:50,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:14:51,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:51,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937832239] [2022-11-03 02:14:51,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937832239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:51,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:14:51,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:14:51,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424004630] [2022-11-03 02:14:51,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:51,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:14:51,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:51,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:14:51,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:14:51,471 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) [2022-11-03 02:14:51,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:51,615 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2022-11-03 02:14:51,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:14:51,618 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 [2022-11-03 02:14:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:51,629 INFO L225 Difference]: With dead ends: 45 [2022-11-03 02:14:51,630 INFO L226 Difference]: Without dead ends: 32 [2022-11-03 02:14:51,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:14:51,640 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:51,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:14:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-03 02:14:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2022-11-03 02:14:51,692 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) [2022-11-03 02:14:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2022-11-03 02:14:51,696 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 10 [2022-11-03 02:14:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:51,698 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-11-03 02:14:51,700 INFO L496 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) [2022-11-03 02:14:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2022-11-03 02:14:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:14:51,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:51,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:51,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:14:51,703 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:14:51,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1483588724, now seen corresponding path program 1 times [2022-11-03 02:14:51,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:51,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11720399] [2022-11-03 02:14:51,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:51,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:14:51,931 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:51,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11720399] [2022-11-03 02:14:51,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11720399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:51,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:14:51,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:14:51,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909745279] [2022-11-03 02:14:51,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:51,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:14:51,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:51,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:14:51,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:14:51,937 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) [2022-11-03 02:14:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:52,018 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-11-03 02:14:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:14:52,019 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 [2022-11-03 02:14:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:52,020 INFO L225 Difference]: With dead ends: 43 [2022-11-03 02:14:52,021 INFO L226 Difference]: Without dead ends: 36 [2022-11-03 02:14:52,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:14:52,023 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:52,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 66 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:14:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-03 02:14:52,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2022-11-03 02:14:52,031 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) [2022-11-03 02:14:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-11-03 02:14:52,032 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 [2022-11-03 02:14:52,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:52,033 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-11-03 02:14:52,033 INFO L496 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) [2022-11-03 02:14:52,034 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-11-03 02:14:52,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:14:52,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:52,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:52,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:14:52,036 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:14:52,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:52,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2029187665, now seen corresponding path program 1 times [2022-11-03 02:14:52,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:52,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045575246] [2022-11-03 02:14:52,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:52,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:14:52,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:52,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045575246] [2022-11-03 02:14:52,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045575246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:52,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:14:52,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:14:52,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246059500] [2022-11-03 02:14:52,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:52,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:14:52,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:52,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:14:52,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:14:52,141 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) [2022-11-03 02:14:52,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:52,210 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-11-03 02:14:52,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:14:52,211 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 [2022-11-03 02:14:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:52,212 INFO L225 Difference]: With dead ends: 40 [2022-11-03 02:14:52,212 INFO L226 Difference]: Without dead ends: 34 [2022-11-03 02:14:52,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:14:52,214 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 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 [2022-11-03 02:14:52,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 74 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:14:52,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-03 02:14:52,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2022-11-03 02:14:52,221 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) [2022-11-03 02:14:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-11-03 02:14:52,222 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 14 [2022-11-03 02:14:52,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:52,223 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-03 02:14:52,223 INFO L496 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) [2022-11-03 02:14:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-11-03 02:14:52,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:14:52,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:52,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:52,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:14:52,225 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:14:52,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:52,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2046198326, now seen corresponding path program 1 times [2022-11-03 02:14:52,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:52,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405655696] [2022-11-03 02:14:52,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:52,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:14:52,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:14:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:14:52,310 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:14:52,311 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:14:52,312 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 02:14:52,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:14:52,325 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-03 02:14:52,330 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:14:52,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:14:52 BoogieIcfgContainer [2022-11-03 02:14:52,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:14:52,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:14:52,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:14:52,398 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:14:52,399 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:14:50" (3/4) ... [2022-11-03 02:14:52,403 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 02:14:52,403 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:14:52,404 INFO L158 Benchmark]: Toolchain (without parser) took 2826.35ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 69.5MB in the beginning and 60.5MB in the end (delta: 9.0MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2022-11-03 02:14:52,404 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 100.7MB. Free memory is still 56.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:14:52,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.99ms. Allocated memory is still 100.7MB. Free memory was 69.5MB in the beginning and 74.9MB in the end (delta: -5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 02:14:52,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.27ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 73.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:14:52,407 INFO L158 Benchmark]: Boogie Preprocessor took 61.98ms. Allocated memory is still 100.7MB. Free memory was 73.3MB in the beginning and 71.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:14:52,407 INFO L158 Benchmark]: RCFGBuilder took 548.18ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 59.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 02:14:52,408 INFO L158 Benchmark]: TraceAbstraction took 1644.60ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 58.9MB in the beginning and 60.5MB in the end (delta: -1.6MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2022-11-03 02:14:52,409 INFO L158 Benchmark]: Witness Printer took 5.10ms. Allocated memory is still 127.9MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:14:52,412 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 100.7MB. Free memory is still 56.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.99ms. Allocated memory is still 100.7MB. Free memory was 69.5MB in the beginning and 74.9MB in the end (delta: -5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.27ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 73.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.98ms. Allocated memory is still 100.7MB. Free memory was 73.3MB in the beginning and 71.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 548.18ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 59.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1644.60ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 58.9MB in the beginning and 60.5MB in the end (delta: -1.6MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Witness Printer took 5.10ms. Allocated memory is still 127.9MB. Free memory is still 60.5MB. 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 call to reach_error is unreachable Unable to prove that 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] 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, __tmp_1=2145386509, inv__A=2145386509, inv__A_u={4:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386510, inv__xi_u={5:0}, main____CPAchecker_TMP_0=1, main__a=2145386509] [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, __tmp_1=2145386509, inv__A=2145386509, inv__A_u={4:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386510, inv__xi_u={5:0}, main____CPAchecker_TMP_0=1, main__a=2145386509] [L56] COND FALSE !(inv__temp > 1.0E-10) VAL [__return_104=0, __return_main=0, __tmp_1=2145386509, inv__A=2145386509, inv__A_u={4:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386510, inv__xi_u={5:0}, main____CPAchecker_TMP_0=1, main__a=2145386509] [L67] COND FALSE !(inv__temp < -1.0E-10) [L73] inv____CPAchecker_TMP_0 = 0 VAL [__return_104=0, __return_main=0, __tmp_1=2145386509, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={4:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386510, inv__xi_u={5:0}, main____CPAchecker_TMP_0=1, main__a=2145386509] [L61] inv__cond = inv____CPAchecker_TMP_0 [L62] inv__xi = inv__xsi VAL [__return_104=0, __return_main=0, __tmp_1=2145386509, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386511, inv__xi_u={5:0}, inv__xsi=2145386511, main____CPAchecker_TMP_0=1, main__a=2145386509] [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=2145386511, __return_main=0, __tmp_1=2145386509, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386511, inv__xi_u={5:0}, inv__xsi=2145386511, main____CPAchecker_TMP_0=1, main__a=2145386509, main__r=2145386511] [L83] COND FALSE !(main__r >= 0) VAL [__return_104=2145386511, __return_main=0, __tmp_1=2145386509, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386511, inv__xi_u={5:0}, inv__xsi=2145386511, main____CPAchecker_TMP_0=1, main__a=2145386509, main__r=2145386511] [L108] main____CPAchecker_TMP_1 = 0 VAL [__return_104=2145386511, __return_main=0, __tmp_1=2145386509, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386511, inv__xi_u={5:0}, inv__xsi=2145386511, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386509, main__r=2145386511] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_1 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [__return_104=2145386511, __return_main=0, __tmp_1=2145386509, __tmp_2=0, __VERIFIER_assert__cond=0, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386511, inv__xi_u={5:0}, inv__xsi=2145386511, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386509, main__r=2145386511] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_104=2145386511, __return_main=0, __tmp_1=2145386509, __tmp_2=0, __VERIFIER_assert__cond=0, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386511, inv__xi_u={5:0}, inv__xsi=2145386511, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386509, main__r=2145386511] [L96] reach_error() VAL [__return_104=2145386511, __return_main=0, __tmp_1=2145386509, __tmp_2=0, __VERIFIER_assert__cond=0, inv____CPAchecker_TMP_0=0, inv__A=2145386509, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386511, inv__xi_u={5:0}, inv__xsi=2145386511, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386509, main__r=2145386511] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 196 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 61 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 19, 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, 46 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 [2022-11-03 02:14:52,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/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_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:14:55,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:14:55,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:14:55,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:14:55,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:14:55,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:14:55,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:14:55,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:14:55,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:14:55,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:14:55,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:14:55,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:14:55,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:14:55,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:14:55,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:14:55,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:14:55,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:14:55,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:14:55,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:14:55,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:14:55,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:14:55,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:14:55,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:14:55,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:14:55,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:14:55,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:14:55,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:14:55,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:14:55,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:14:55,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:14:55,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:14:55,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:14:55,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:14:55,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:14:55,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:14:55,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:14:55,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:14:55,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:14:55,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:14:55,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:14:55,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:14:55,525 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 02:14:55,564 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:14:55,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:14:55,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:14:55,565 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:14:55,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:14:55,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:14:55,567 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:14:55,567 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:14:55,567 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:14:55,567 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:14:55,568 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:14:55,568 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:14:55,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:14:55,569 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:14:55,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:14:55,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:14:55,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:14:55,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:14:55,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:14:55,570 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:14:55,571 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 02:14:55,571 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 02:14:55,571 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:14:55,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:14:55,572 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:14:55,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:14:55,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:14:55,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 02:14:55,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:14:55,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:14:55,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:14:55,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:14:55,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:14:55,574 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 02:14:55,574 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 02:14:55,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:14:55,575 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:14:55,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 02:14:55,575 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/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_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2022-11-03 02:14:55,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:14:56,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:14:56,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:14:56,017 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:14:56,018 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:14:56,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2022-11-03 02:14:56,112 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/data/34fa637f3/214d827267f940f9ba4c8508875c95b4/FLAGf20fb6a52 [2022-11-03 02:14:56,783 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:14:56,788 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2022-11-03 02:14:56,798 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/data/34fa637f3/214d827267f940f9ba4c8508875c95b4/FLAGf20fb6a52 [2022-11-03 02:14:57,114 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/data/34fa637f3/214d827267f940f9ba4c8508875c95b4 [2022-11-03 02:14:57,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:14:57,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:14:57,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:14:57,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:14:57,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:14:57,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:14:57" (1/1) ... [2022-11-03 02:14:57,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b493a86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:57, skipping insertion in model container [2022-11-03 02:14:57,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:14:57" (1/1) ... [2022-11-03 02:14:57,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:14:57,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:14:57,374 WARN L230 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_f7f53027-773c-4289-8b38-b22089d2ea6f/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2022-11-03 02:14:57,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:14:57,443 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:14:57,489 WARN L230 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_f7f53027-773c-4289-8b38-b22089d2ea6f/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2022-11-03 02:14:57,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:14:57,513 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:14:57,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:57 WrapperNode [2022-11-03 02:14:57,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:14:57,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:14:57,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:14:57,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:14:57,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:57" (1/1) ... [2022-11-03 02:14:57,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:57" (1/1) ... [2022-11-03 02:14:57,575 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 99 [2022-11-03 02:14:57,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:14:57,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:14:57,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:14:57,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:14:57,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:57" (1/1) ... [2022-11-03 02:14:57,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:57" (1/1) ... [2022-11-03 02:14:57,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:57" (1/1) ... [2022-11-03 02:14:57,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:57" (1/1) ... [2022-11-03 02:14:57,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:57" (1/1) ... [2022-11-03 02:14:57,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:57" (1/1) ... [2022-11-03 02:14:57,640 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:57" (1/1) ... [2022-11-03 02:14:57,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:57" (1/1) ... [2022-11-03 02:14:57,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:14:57,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:14:57,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:14:57,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:14:57,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:57" (1/1) ... [2022-11-03 02:14:57,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:14:57,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:57,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:14:57,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:14:57,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:14:57,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-11-03 02:14:57,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-11-03 02:14:57,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 02:14:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:14:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 02:14:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:14:57,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:14:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:14:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 02:14:57,840 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:14:57,843 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:15:00,390 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:15:00,397 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:15:00,397 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 02:15:00,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:15:00 BoogieIcfgContainer [2022-11-03 02:15:00,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:15:00,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:15:00,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:15:00,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:15:00,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:14:57" (1/3) ... [2022-11-03 02:15:00,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7d48ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:15:00, skipping insertion in model container [2022-11-03 02:15:00,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:14:57" (2/3) ... [2022-11-03 02:15:00,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7d48ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:15:00, skipping insertion in model container [2022-11-03 02:15:00,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:15:00" (3/3) ... [2022-11-03 02:15:00,411 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2022-11-03 02:15:00,431 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:15:00,431 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:15:00,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:15:00,513 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@5d413b9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:15:00,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:15:00,518 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) [2022-11-03 02:15:00,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:15:00,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:00,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:00,539 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:00,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:00,544 INFO L85 PathProgramCache]: Analyzing trace with hash -938930996, now seen corresponding path program 1 times [2022-11-03 02:15:00,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:15:00,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796391583] [2022-11-03 02:15:00,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:00,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:15:00,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:15:00,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:15:00,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 02:15:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:00,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:15:00,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:00,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:15:00,808 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:15:00,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796391583] [2022-11-03 02:15:00,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796391583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:00,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:15:00,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:15:00,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670067067] [2022-11-03 02:15:00,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:00,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:15:00,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:15:00,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:15:00,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:15:00,857 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) [2022-11-03 02:15:03,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:15:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:03,224 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-11-03 02:15:03,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:15:03,229 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 [2022-11-03 02:15:03,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:03,239 INFO L225 Difference]: With dead ends: 32 [2022-11-03 02:15:03,239 INFO L226 Difference]: Without dead ends: 19 [2022-11-03 02:15:03,242 INFO L412 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 [2022-11-03 02:15:03,256 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:03,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-03 02:15:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-03 02:15:03,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-03 02:15:03,298 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) [2022-11-03 02:15:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-11-03 02:15:03,302 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2022-11-03 02:15:03,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:03,303 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-11-03 02:15:03,304 INFO L496 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) [2022-11-03 02:15:03,304 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-11-03 02:15:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:15:03,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:03,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:03,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:15:03,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:15:03,519 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:03,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:03,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1250925041, now seen corresponding path program 1 times [2022-11-03 02:15:03,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:15:03,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923706764] [2022-11-03 02:15:03,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:03,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:15:03,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:15:03,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:15:03,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 02:15:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:04,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:15:04,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:04,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:15:04,546 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:15:04,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923706764] [2022-11-03 02:15:04,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923706764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:04,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:15:04,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:15:04,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697781183] [2022-11-03 02:15:04,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:04,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:15:04,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:15:04,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:15:04,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:15:04,551 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) [2022-11-03 02:15:06,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 02:15:06,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:06,954 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-11-03 02:15:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:15:06,955 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 [2022-11-03 02:15:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:06,956 INFO L225 Difference]: With dead ends: 28 [2022-11-03 02:15:06,956 INFO L226 Difference]: Without dead ends: 21 [2022-11-03 02:15:06,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:15:06,958 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:06,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-03 02:15:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-03 02:15:06,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-11-03 02:15:06,963 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) [2022-11-03 02:15:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-11-03 02:15:06,964 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 15 [2022-11-03 02:15:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:06,965 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-11-03 02:15:06,965 INFO L496 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) [2022-11-03 02:15:06,965 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-11-03 02:15:06,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:15:06,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:06,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:06,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:15:07,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:15:07,178 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:07,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:07,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1796523982, now seen corresponding path program 1 times [2022-11-03 02:15:07,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:15:07,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560300812] [2022-11-03 02:15:07,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:07,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:15:07,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:15:07,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:15:07,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 02:15:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:07,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:15:07,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:15:08,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:15:08,039 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:15:08,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560300812] [2022-11-03 02:15:08,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560300812] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:08,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:15:08,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:15:08,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042820080] [2022-11-03 02:15:08,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:08,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:15:08,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:15:08,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:15:08,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:15:08,043 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) [2022-11-03 02:15:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:08,131 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-11-03 02:15:08,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:15:08,132 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 [2022-11-03 02:15:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:08,133 INFO L225 Difference]: With dead ends: 24 [2022-11-03 02:15:08,133 INFO L226 Difference]: Without dead ends: 20 [2022-11-03 02:15:08,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:15:08,135 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 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.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:08,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:15:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-03 02:15:08,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-03 02:15:08,140 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) [2022-11-03 02:15:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-11-03 02:15:08,141 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2022-11-03 02:15:08,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:08,141 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-11-03 02:15:08,142 INFO L496 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) [2022-11-03 02:15:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-11-03 02:15:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:15:08,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:08,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:08,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-03 02:15:08,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:15:08,368 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:08,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:08,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1813534643, now seen corresponding path program 1 times [2022-11-03 02:15:08,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:15:08,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883874057] [2022-11-03 02:15:08,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:08,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:15:08,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:15:08,370 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:15:08,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 02:15:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:12,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-03 02:15:12,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:36,113 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ 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)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (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)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (= |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:15:59,593 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ 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)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (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)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (= |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0))))) (not (fp.gt |c_ULTIMATE.start_main_~inv__temp~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:16:27,339 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ 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)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (not (fp.lt .cse0 (fp.neg .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 |ULTIMATE.start_main_~inv__A~0#1| .cse2) .cse2)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (not (fp.gt .cse0 .cse1)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:16:55,095 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ 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_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse3)) (.cse2 ((_ 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)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= .cse0 |c_ULTIMATE.start_main_~inv__xi~0#1|) (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .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 [2022-11-03 02:17:23,039 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ 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 (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (= .cse2 |c_ULTIMATE.start_main_~main__r~0#1|) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:17:52,822 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ 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.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 20.0)))))) is different from false [2022-11-03 02:17:54,891 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ 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.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 20.0)))))) is different from true [2022-11-03 02:19:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 02:19:06,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:19:22,340 WARN L833 $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.lt .cse0 (fp.neg .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse0 .cse1)))) is different from false [2022-11-03 02:19:24,474 WARN L855 $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.lt .cse0 (fp.neg .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse0 .cse1)))) is different from true [2022-11-03 02:19:38,742 WARN L234 SmtUtils]: Spent 5.42s on a formula simplification. DAG size of input: 25 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 02:19:45,552 WARN L855 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_4| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_4|) (_ bv1023 32)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (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 |c_ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))))))) is different from true [2022-11-03 02:20:00,859 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_4| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_4|) (_ bv1023 32)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (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 |c_ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))))))) (not (fp.leq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)))) is different from true [2022-11-03 02:20:16,084 WARN L833 $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))) (not (fp.geq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_4| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_4|) (_ bv1023 32)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (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 |ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))))) is different from false [2022-11-03 02:20:18,203 WARN L855 $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))) (not (fp.geq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_4| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_4|) (_ bv1023 32)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (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 |ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))))) is different from true [2022-11-03 02:20:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 02:20:31,505 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:20:31,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883874057] [2022-11-03 02:20:31,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883874057] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:20:31,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [127982120] [2022-11-03 02:20:31,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:31,506 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:20:31,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:20:31,516 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:20:31,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-03 02:20:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:34,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 02:20:34,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:23:06,118 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse3) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse0 (fp.sub roundNearestTiesToEven .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse0 .cse1)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.geq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 20.0))))))) is different from false [2022-11-03 02:23:08,215 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse3) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse0 (fp.sub roundNearestTiesToEven .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse0 .cse1)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.geq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 20.0))))))) is different from true [2022-11-03 02:24:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 02:24:24,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:24:44,288 WARN L234 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 25 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 02:25:00,388 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_6| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_6|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (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 |c_ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (forall ((v_skolemized_v_prenex_1_8 (_ BitVec 64))) (not (= |c_ULTIMATE.start_main_~main__a~0#1| (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))))) is different from true [2022-11-03 02:25:16,298 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_6| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_6|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (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 |c_ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (forall ((v_skolemized_v_prenex_1_8 (_ BitVec 64))) (not (= |c_ULTIMATE.start_main_~main__a~0#1| (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))))) (not (fp.leq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)))) is different from true [2022-11-03 02:25:40,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_6| (_ BitVec 32)) (v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))) (.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_6|)) (_ 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)))) (or (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (fp.lt (fp.sub c_currentRoundingMode .cse1 .cse2) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (fp.geq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from false [2022-11-03 02:25:43,022 WARN L855 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_6| (_ BitVec 32)) (v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))) (.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_6|)) (_ 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)))) (or (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (not (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (fp.lt (fp.sub c_currentRoundingMode .cse1 .cse2) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (fp.geq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from true [2022-11-03 02:26:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 02:26:05,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [127982120] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:26:05,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525021140] [2022-11-03 02:26:05,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:26:05,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:26:05,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:26:05,437 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:26:05,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7f53027-773c-4289-8b38-b22089d2ea6f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:27:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:27:37,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 02:27:37,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:28:04,261 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_1_10 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_10) ((_ extract 62 52) v_skolemized_v_prenex_1_10) ((_ extract 51 0) v_skolemized_v_prenex_1_10))) (.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 31 0) v_skolemized_v_prenex_1_10)) (_ 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)) (= (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse1) |c_ULTIMATE.start_main_~inv__temp~0#1|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (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_ULTIMATE.start_main_~inv__xsi~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:28:50,523 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_1_10 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_10) ((_ extract 62 52) v_skolemized_v_prenex_1_10) ((_ extract 51 0) v_skolemized_v_prenex_1_10))) (.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 31 0) v_skolemized_v_prenex_1_10)) (_ 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)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (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))))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (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_ULTIMATE.start_main_~inv__xsi~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:29:15,170 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_1_10 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_10) ((_ extract 62 52) v_skolemized_v_prenex_1_10) ((_ extract 51 0) v_skolemized_v_prenex_1_10))) (.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 31 0) v_skolemized_v_prenex_1_10)) (_ 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)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (not (fp.lt (fp.sub c_currentRoundingMode .cse1 .cse2) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= .cse1 |c_ULTIMATE.start_main_~inv__xi~0#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:29:39,405 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_1_10 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_10) ((_ extract 62 52) v_skolemized_v_prenex_1_10) ((_ extract 51 0) v_skolemized_v_prenex_1_10))) (.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 31 0) v_skolemized_v_prenex_1_10)) (_ 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)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (not (fp.lt (fp.sub c_currentRoundingMode .cse1 .cse2) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= .cse1 |c_ULTIMATE.start_main_~main__r~0#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:30:05,757 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_skolemized_v_prenex_1_10 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_10) ((_ extract 62 52) v_skolemized_v_prenex_1_10) ((_ extract 51 0) v_skolemized_v_prenex_1_10))) (.cse1 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 31 0) v_skolemized_v_prenex_1_10)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse1) .cse1)))) (and (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (fp.geq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))))) is different from false [2022-11-03 02:30:07,860 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_skolemized_v_prenex_1_10 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_10) ((_ extract 62 52) v_skolemized_v_prenex_1_10) ((_ extract 51 0) v_skolemized_v_prenex_1_10))) (.cse1 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 31 0) v_skolemized_v_prenex_1_10)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse1) .cse1)))) (and (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (fp.geq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))))) is different from true