./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_Newton-1.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_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 --- 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-02 20:57:01,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:57:01,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:57:01,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:57:01,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:57:01,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:57:01,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:57:01,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:57:01,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:57:01,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:57:01,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:57:01,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:57:01,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:57:01,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:57:01,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:57:01,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:57:01,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:57:01,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:57:01,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:57:01,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:57:01,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:57:01,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:57:01,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:57:01,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:57:01,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:57:01,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:57:01,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:57:01,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:57:01,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:57:01,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:57:01,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:57:01,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:57:01,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:57:01,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:57:01,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:57:01,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:57:01,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:57:01,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:57:01,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:57:01,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:57:01,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:57:01,142 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:57:01,166 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:57:01,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:57:01,167 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:57:01,167 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:57:01,168 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:57:01,168 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:57:01,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:57:01,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:57:01,169 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:57:01,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:57:01,170 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:57:01,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:57:01,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:57:01,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:57:01,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:57:01,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:57:01,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:57:01,171 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:57:01,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:57:01,172 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:57:01,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:57:01,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:57:01,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:57:01,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:57:01,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:01,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:57:01,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:57:01,174 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:57:01,174 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:57:01,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:57:01,174 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:57:01,175 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:57:01,175 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:57:01,175 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_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/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_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 [2022-11-02 20:57:01,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:57:01,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:57:01,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:57:01,541 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:57:01,542 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:57:01,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-11-02 20:57:01,638 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/data/bb4b27288/d44966f1f05c4098ab9929a71edb430b/FLAG473bfa374 [2022-11-02 20:57:02,257 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:57:02,259 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-11-02 20:57:02,268 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/data/bb4b27288/d44966f1f05c4098ab9929a71edb430b/FLAG473bfa374 [2022-11-02 20:57:02,600 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/data/bb4b27288/d44966f1f05c4098ab9929a71edb430b [2022-11-02 20:57:02,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:57:02,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:57:02,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:02,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:57:02,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:57:02,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:02" (1/1) ... [2022-11-02 20:57:02,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68118187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:02, skipping insertion in model container [2022-11-02 20:57:02,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:02" (1/1) ... [2022-11-02 20:57:02,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:57:02,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:57:02,872 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_3398db30-7d0c-4032-b72f-ec7a966cc4ac/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2022-11-02 20:57:02,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:02,919 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:57:02,930 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_3398db30-7d0c-4032-b72f-ec7a966cc4ac/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2022-11-02 20:57:02,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:02,956 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:57:02,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:02 WrapperNode [2022-11-02 20:57:02,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:02,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:02,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:57:02,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:57:02,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:02" (1/1) ... [2022-11-02 20:57:02,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:02" (1/1) ... [2022-11-02 20:57:02,997 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2022-11-02 20:57:02,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:02,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:57:02,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:57:02,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:57:03,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:02" (1/1) ... [2022-11-02 20:57:03,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:02" (1/1) ... [2022-11-02 20:57:03,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:02" (1/1) ... [2022-11-02 20:57:03,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:02" (1/1) ... [2022-11-02 20:57:03,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:02" (1/1) ... [2022-11-02 20:57:03,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:02" (1/1) ... [2022-11-02 20:57:03,050 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:02" (1/1) ... [2022-11-02 20:57:03,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:02" (1/1) ... [2022-11-02 20:57:03,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:57:03,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:57:03,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:57:03,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:57:03,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:02" (1/1) ... [2022-11-02 20:57:03,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:03,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:03,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:57:03,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:57:03,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:57:03,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:57:03,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:57:03,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-02 20:57:03,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:57:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-11-02 20:57:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:57:03,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:57:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:57:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:57:03,268 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:57:03,270 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:57:03,502 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:57:03,508 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:57:03,508 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:57:03,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:03 BoogieIcfgContainer [2022-11-02 20:57:03,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:57:03,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:57:03,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:57:03,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:57:03,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:57:02" (1/3) ... [2022-11-02 20:57:03,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba47ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:03, skipping insertion in model container [2022-11-02 20:57:03,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:02" (2/3) ... [2022-11-02 20:57:03,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba47ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:03, skipping insertion in model container [2022-11-02 20:57:03,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:03" (3/3) ... [2022-11-02 20:57:03,521 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton-1.c [2022-11-02 20:57:03,541 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:57:03,542 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:57:03,651 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:57:03,671 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=PETRI_NET, 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;@665cdef1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:57:03,681 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:57:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-02 20:57:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:57:03,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:03,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:03,695 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:03,702 INFO L85 PathProgramCache]: Analyzing trace with hash -590190995, now seen corresponding path program 1 times [2022-11-02 20:57:03,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:03,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188239837] [2022-11-02 20:57:03,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:03,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:03,976 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-02 20:57:03,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:03,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188239837] [2022-11-02 20:57:03,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188239837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:03,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:03,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:03,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556111459] [2022-11-02 20:57:03,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:03,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:57:03,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:04,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:57:04,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:57:04,037 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:04,058 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-11-02 20:57:04,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:57:04,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:57:04,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:04,077 INFO L225 Difference]: With dead ends: 25 [2022-11-02 20:57:04,078 INFO L226 Difference]: Without dead ends: 10 [2022-11-02 20:57:04,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:57:04,087 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:04,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-02 20:57:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-02 20:57:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-02 20:57:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-11-02 20:57:04,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2022-11-02 20:57:04,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:04,127 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-11-02 20:57:04,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-11-02 20:57:04,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:57:04,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:04,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:04,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:57:04,164 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:04,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1184816367, now seen corresponding path program 1 times [2022-11-02 20:57:04,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:04,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567768953] [2022-11-02 20:57:04,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:04,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:04,396 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-02 20:57:04,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:04,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567768953] [2022-11-02 20:57:04,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567768953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:04,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:04,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:04,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206515057] [2022-11-02 20:57:04,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:04,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:04,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:04,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:04,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:04,412 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:04,427 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-11-02 20:57:04,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:04,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:57:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:04,429 INFO L225 Difference]: With dead ends: 16 [2022-11-02 20:57:04,430 INFO L226 Difference]: Without dead ends: 11 [2022-11-02 20:57:04,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02 20:57:04,434 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:04,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-02 20:57:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-02 20:57:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-02 20:57:04,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-11-02 20:57:04,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-11-02 20:57:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:04,446 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-11-02 20:57:04,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-11-02 20:57:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:57:04,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:04,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:04,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:57:04,450 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:04,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:04,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1873743609, now seen corresponding path program 1 times [2022-11-02 20:57:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:04,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519690123] [2022-11-02 20:57:04,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:04,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:57:04,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:57:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:57:04,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:57:04,670 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:57:04,672 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:57:04,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:57:04,683 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-02 20:57:04,687 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:57:04,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:57:04 BoogieIcfgContainer [2022-11-02 20:57:04,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:57:04,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:57:04,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:57:04,717 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:57:04,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:03" (3/4) ... [2022-11-02 20:57:04,722 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:57:04,722 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:57:04,723 INFO L158 Benchmark]: Toolchain (without parser) took 2118.76ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 64.7MB in the beginning and 79.2MB in the end (delta: -14.5MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-11-02 20:57:04,724 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 98.6MB. Free memory was 69.8MB in the beginning and 69.8MB in the end (delta: 28.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:57:04,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.50ms. Allocated memory is still 98.6MB. Free memory was 64.4MB in the beginning and 73.9MB in the end (delta: -9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:57:04,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.02ms. Allocated memory is still 98.6MB. Free memory was 73.9MB in the beginning and 72.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:57:04,727 INFO L158 Benchmark]: Boogie Preprocessor took 62.96ms. Allocated memory is still 98.6MB. Free memory was 72.1MB in the beginning and 70.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:57:04,727 INFO L158 Benchmark]: RCFGBuilder took 448.38ms. Allocated memory is still 98.6MB. Free memory was 70.9MB in the beginning and 58.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:57:04,728 INFO L158 Benchmark]: TraceAbstraction took 1203.52ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 57.9MB in the beginning and 79.8MB in the end (delta: -21.9MB). Peak memory consumption was 338.0kB. Max. memory is 16.1GB. [2022-11-02 20:57:04,729 INFO L158 Benchmark]: Witness Printer took 5.59ms. Allocated memory is still 121.6MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:57:04,732 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.27ms. Allocated memory is still 98.6MB. Free memory was 69.8MB in the beginning and 69.8MB in the end (delta: 28.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.50ms. Allocated memory is still 98.6MB. Free memory was 64.4MB in the beginning and 73.9MB in the end (delta: -9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.02ms. Allocated memory is still 98.6MB. Free memory was 73.9MB in the beginning and 72.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.96ms. Allocated memory is still 98.6MB. Free memory was 72.1MB in the beginning and 70.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 448.38ms. Allocated memory is still 98.6MB. Free memory was 70.9MB in the beginning and 58.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1203.52ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 57.9MB in the beginning and 79.8MB in the end (delta: -21.9MB). Peak memory consumption was 338.0kB. Max. memory is 16.1GB. * Witness Printer took 5.59ms. Allocated memory is still 121.6MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 36, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of to_real at line 31. Possible FailurePath: [L46] double a,r; [L48] a = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not(a >= 20. && a <= 30.) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume_abort_if_not(a >= 20. && a <= 30.) [L51] CALL, EXPR inv(a) [L26] double xi, xsi, temp; [L27] signed int cond, exp; [L28] union double_int A_u, xi_u; [L29] A_u.d = A [L30] EXPR A_u.i [L30] exp = (signed int) ((A_u.i & 0x7FF0000000000000) >> 52) - 1023 [L31] xi_u.d = 1 [L32] xi_u.i = (((long long)(1023-exp)) << 52) [L33] EXPR xi_u.d [L33] xi = xi_u.d [L34] cond = 1 VAL [\old(A)=9214364837600034832, A=9214364837600034832, A_u={4:0}, cond=1, exp=-1023, xi=9214364837600034831, xi_u={5:0}] [L35] COND TRUE \read(cond) [L36] xsi = 2*xi-A*xi*xi [L37] temp = xsi-xi [L38] cond = ((temp > 1e-10) || (temp < -1e-10)) [L39] xi = xsi VAL [\old(A)=9214364837600034832, A=9214364837600034832, A_u={4:0}, cond=0, exp=-1023, xi=9214364837600034830, xi_u={5:0}, xsi=9214364837600034830] [L35] COND FALSE !(\read(cond)) VAL [\old(A)=9214364837600034832, A=9214364837600034832, A_u={4:0}, cond=0, exp=-1023, xi=9214364837600034830, xi_u={5:0}, xsi=9214364837600034830] [L41] return xi; [L41] return xi; [L41] return xi; VAL [\old(A)=9214364837600034832, \result=9214364837600034830, A=9214364837600034832, cond=0, exp=-1023, xi=9214364837600034830, xsi=9214364837600034830] [L51] RET, EXPR inv(a) [L51] r = inv(a) [L53] CALL __VERIFIER_assert(r >= 0 && r <= 0.06) [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 23 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 20:57:04,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/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_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 --- 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-02 20:57:07,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:57:07,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:57:07,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:57:07,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:57:07,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:57:07,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:57:07,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:57:07,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:57:07,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:57:07,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:57:07,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:57:07,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:57:07,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:57:07,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:57:07,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:57:07,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:57:07,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:57:07,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:57:07,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:57:07,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:57:07,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:57:07,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:57:07,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:57:07,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:57:07,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:57:07,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:57:07,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:57:07,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:57:07,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:57:07,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:57:07,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:57:07,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:57:07,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:57:07,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:57:07,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:57:07,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:57:07,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:57:07,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:57:07,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:57:07,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:57:07,622 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-02 20:57:07,665 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:57:07,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:57:07,666 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:57:07,667 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:57:07,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:57:07,668 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:57:07,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:57:07,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:57:07,670 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:57:07,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:57:07,671 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:57:07,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:57:07,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:57:07,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:57:07,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:57:07,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:57:07,673 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:57:07,673 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-02 20:57:07,674 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-02 20:57:07,674 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:57:07,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:57:07,674 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:57:07,675 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:57:07,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:57:07,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:57:07,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:57:07,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:07,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:57:07,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:57:07,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:57:07,677 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-02 20:57:07,677 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-02 20:57:07,678 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:57:07,678 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:57:07,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:57:07,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-02 20:57:07,679 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_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/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_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 [2022-11-02 20:57:08,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:57:08,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:57:08,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:57:08,105 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:57:08,106 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:57:08,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-11-02 20:57:08,185 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/data/7f6d448b5/3df6413186224acdb81141586e146615/FLAG117bc7661 [2022-11-02 20:57:08,758 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:57:08,759 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-11-02 20:57:08,767 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/data/7f6d448b5/3df6413186224acdb81141586e146615/FLAG117bc7661 [2022-11-02 20:57:09,083 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/data/7f6d448b5/3df6413186224acdb81141586e146615 [2022-11-02 20:57:09,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:57:09,088 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:57:09,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:09,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:57:09,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:57:09,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:09" (1/1) ... [2022-11-02 20:57:09,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b575533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:09, skipping insertion in model container [2022-11-02 20:57:09,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:09" (1/1) ... [2022-11-02 20:57:09,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:57:09,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:57:09,319 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_3398db30-7d0c-4032-b72f-ec7a966cc4ac/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2022-11-02 20:57:09,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:09,376 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:57:09,404 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_3398db30-7d0c-4032-b72f-ec7a966cc4ac/sv-benchmarks/c/float-benchs/inv_Newton-1.c[598,611] [2022-11-02 20:57:09,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:09,458 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:57:09,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:09 WrapperNode [2022-11-02 20:57:09,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:09,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:09,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:57:09,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:57:09,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:09" (1/1) ... [2022-11-02 20:57:09,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:09" (1/1) ... [2022-11-02 20:57:09,527 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2022-11-02 20:57:09,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:09,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:57:09,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:57:09,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:57:09,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:09" (1/1) ... [2022-11-02 20:57:09,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:09" (1/1) ... [2022-11-02 20:57:09,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:09" (1/1) ... [2022-11-02 20:57:09,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:09" (1/1) ... [2022-11-02 20:57:09,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:09" (1/1) ... [2022-11-02 20:57:09,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:09" (1/1) ... [2022-11-02 20:57:09,587 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:09" (1/1) ... [2022-11-02 20:57:09,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:09" (1/1) ... [2022-11-02 20:57:09,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:57:09,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:57:09,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:57:09,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:57:09,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:09" (1/1) ... [2022-11-02 20:57:09,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:09,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:09,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:57:09,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:57:09,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:57:09,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-11-02 20:57:09,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-11-02 20:57:09,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-02 20:57:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:57:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-02 20:57:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:57:09,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:57:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-02 20:57:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:57:09,845 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:57:09,847 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:57:12,220 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:57:12,226 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:57:12,226 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:57:12,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:12 BoogieIcfgContainer [2022-11-02 20:57:12,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:57:12,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:57:12,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:57:12,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:57:12,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:57:09" (1/3) ... [2022-11-02 20:57:12,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1460a1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:12, skipping insertion in model container [2022-11-02 20:57:12,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:09" (2/3) ... [2022-11-02 20:57:12,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1460a1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:12, skipping insertion in model container [2022-11-02 20:57:12,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:12" (3/3) ... [2022-11-02 20:57:12,238 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton-1.c [2022-11-02 20:57:12,261 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:57:12,262 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:57:12,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:57:12,345 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=PETRI_NET, 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;@192114ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:57:12,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:57:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-02 20:57:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:57:12,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:12,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:12,373 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:12,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:12,387 INFO L85 PathProgramCache]: Analyzing trace with hash -590190995, now seen corresponding path program 1 times [2022-11-02 20:57:12,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:57:12,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839767741] [2022-11-02 20:57:12,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:12,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:57:12,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:57:12,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:57:12,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-02 20:57:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:12,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-02 20:57:12,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:12,736 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-02 20:57:12,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:57:12,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:57:12,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839767741] [2022-11-02 20:57:12,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839767741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:12,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:12,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:12,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429703384] [2022-11-02 20:57:12,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:12,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:57:12,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:57:12,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:57:12,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:57:12,796 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:12,813 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-11-02 20:57:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:57:12,815 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:57:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:12,825 INFO L225 Difference]: With dead ends: 25 [2022-11-02 20:57:12,825 INFO L226 Difference]: Without dead ends: 10 [2022-11-02 20:57:12,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:57:12,835 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:12,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-02 20:57:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-02 20:57:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-02 20:57:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-11-02 20:57:12,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2022-11-02 20:57:12,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:12,885 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-11-02 20:57:12,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-11-02 20:57:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:57:12,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:12,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:12,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:13,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:57:13,105 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:13,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:13,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1184816367, now seen corresponding path program 1 times [2022-11-02 20:57:13,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:57:13,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989664801] [2022-11-02 20:57:13,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:13,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:57:13,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:57:13,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:57:13,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-02 20:57:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:13,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:57:13,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:13,363 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-02 20:57:13,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:57:13,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:57:13,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989664801] [2022-11-02 20:57:13,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989664801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:13,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:13,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:13,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966579065] [2022-11-02 20:57:13,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:13,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:13,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:57:13,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:13,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:13,379 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:15,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-02 20:57:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:15,734 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-11-02 20:57:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:15,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:57:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:15,736 INFO L225 Difference]: With dead ends: 16 [2022-11-02 20:57:15,736 INFO L226 Difference]: Without dead ends: 11 [2022-11-02 20:57:15,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-02 20:57:15,739 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:15,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 20:57:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-02 20:57:15,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-02 20:57:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-02 20:57:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-11-02 20:57:15,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-11-02 20:57:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:15,746 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-11-02 20:57:15,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-11-02 20:57:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:57:15,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:15,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:15,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:15,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:57:15,967 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:15,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1873743609, now seen corresponding path program 1 times [2022-11-02 20:57:15,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:57:15,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478068250] [2022-11-02 20:57:15,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:15,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:57:15,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:57:15,972 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:57:16,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3398db30-7d0c-4032-b72f-ec7a966cc4ac/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-02 20:57:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:17,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-02 20:57:17,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:28,362 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse1 (fp.neg .cse2)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (or (and (exists ((v_ArrVal_53 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse7 (let ((.cse8 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse7)) (.cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (not (fp.lt .cse0 .cse1)) (not (fp.gt .cse0 .cse2)) (fp.geq .cse3 .cse4) (fp.leq .cse3 .cse5) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse7) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse7) .cse7)) |c_ULTIMATE.start_inv_~xi~0#1|))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32))) (and (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse9 (let ((.cse11 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))))) (and (fp.gt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse9) .cse2) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse9) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse10 .cse9) .cse9)) |c_ULTIMATE.start_inv_~xi~0#1|)))) (fp.geq .cse10 .cse4) (fp.leq .cse10 .cse5)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse12 (let ((.cse14 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse14) ((_ extract 62 52) .cse14) ((_ extract 51 0) .cse14))))) (and (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse12) .cse1) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 .cse12) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse13 .cse12) .cse12)) |c_ULTIMATE.start_inv_~xi~0#1|)))) (fp.geq .cse13 .cse4) (fp.leq .cse13 .cse5))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv1 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-02 20:58:51,878 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_53 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))) (.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.gt .cse0 .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (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 .cse2 .cse3) .cse3)) |c_ULTIMATE.start_inv_~xi~0#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-02 20:59:15,565 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_53 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_#res#1| .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))) (.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (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 .cse2 .cse3) .cse3)) |c_ULTIMATE.start_inv_#res#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-02 21:01:00,902 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse6 (fp.neg .cse5)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((v_ArrVal_53 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|))) (.cse9 (let ((.cse11 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse9) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse9) .cse9)))) (let ((.cse4 (fp.sub roundNearestTiesToEven .cse0 .cse9))) (and (fp.leq .cse0 .cse1) (fp.geq .cse2 .cse3) (not (fp.gt .cse4 .cse5)) (not (fp.lt .cse4 .cse6)) (fp.leq .cse2 .cse7) (fp.geq .cse0 .cse8))))))) (and (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse12 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse12 .cse3) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse15 (let ((.cse16 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse16) ((_ extract 62 52) .cse16) ((_ extract 51 0) .cse16))))) (let ((.cse14 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse15) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 .cse15) .cse15)))) (let ((.cse13 (fp.sub roundNearestTiesToEven .cse14 .cse15))) (and (not (fp.gt .cse13 .cse5)) (not (fp.lt .cse13 .cse6)) (not (fp.leq .cse14 .cse1))))))) (fp.leq .cse12 .cse7)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse17 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse17 .cse3) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse19 (let ((.cse20 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse20) ((_ extract 62 52) .cse20) ((_ extract 51 0) .cse20))))) (let ((.cse18 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse19) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse17 .cse19) .cse19)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse18 .cse19) .cse6)) (not (fp.geq .cse18 .cse8)))))) (fp.leq .cse17 .cse7))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2022-11-02 21:01:29,308 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse4 (fp.neg .cse3)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse0 .cse1) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse6 (let ((.cse8 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse6) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse6) .cse6)))) (let ((.cse2 (fp.sub roundNearestTiesToEven .cse5 .cse6))) (and (not (fp.gt .cse2 .cse3)) (not (fp.lt .cse2 .cse4)) (not (fp.leq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))))))))) (fp.leq .cse0 .cse9)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse10 .cse1) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse12 (let ((.cse13 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (let ((.cse11 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse12) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse12) .cse12)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse11 .cse12) .cse4)) (not (fp.geq .cse11 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) (fp.leq .cse10 .cse9))))))) is different from false [2022-11-02 21:01:31,430 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse4 (fp.neg .cse3)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse0 .cse1) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse6 (let ((.cse8 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse6) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse6) .cse6)))) (let ((.cse2 (fp.sub roundNearestTiesToEven .cse5 .cse6))) (and (not (fp.gt .cse2 .cse3)) (not (fp.lt .cse2 .cse4)) (not (fp.leq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))))))))) (fp.leq .cse0 .cse9)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse10 .cse1) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse12 (let ((.cse13 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (let ((.cse11 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse12) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse12) .cse12)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse11 .cse12) .cse4)) (not (fp.geq .cse11 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) (fp.leq .cse10 .cse9))))))) is different from true [2022-11-02 21:01:31,431 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-02 21:01:31,431 INFO L328 TraceCheckSpWp]: Computing backward predicates...