./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter2_reinit.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_reinit.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro --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 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 --- 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-8393723 [2022-11-18 20:28:57,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:28:57,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:28:57,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:28:57,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:28:57,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:28:57,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:28:57,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:28:57,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:28:57,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:28:57,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:28:57,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:28:57,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:28:57,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:28:57,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:28:57,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:28:57,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:28:57,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:28:57,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:28:57,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:28:57,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:28:57,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:28:57,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:28:57,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:28:57,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:28:57,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:28:57,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:28:57,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:28:57,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:28:57,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:28:57,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:28:57,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:28:57,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:28:57,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:28:57,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:28:57,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:28:57,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:28:57,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:28:57,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:28:57,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:28:57,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:28:57,367 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:28:57,417 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:28:57,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:28:57,418 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:28:57,418 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:28:57,419 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:28:57,419 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:28:57,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:28:57,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:28:57,421 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:28:57,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:28:57,422 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:28:57,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:28:57,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:28:57,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:28:57,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:28:57,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:28:57,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:28:57,423 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:28:57,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:28:57,424 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:28:57,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:28:57,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:28:57,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:28:57,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:28:57,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:28:57,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:28:57,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:28:57,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:28:57,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:28:57,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:28:57,426 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:28:57,426 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:28:57,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:28:57,427 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_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/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_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro 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 -> 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 [2022-11-18 20:28:57,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:28:57,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:28:57,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:28:57,868 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:28:57,869 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:28:57,871 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-11-18 20:28:57,941 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/data/d69b41798/441fdf62f8534171a735a6a1d8d30632/FLAGe365d2410 [2022-11-18 20:28:58,404 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:28:58,404 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-11-18 20:28:58,412 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/data/d69b41798/441fdf62f8534171a735a6a1d8d30632/FLAGe365d2410 [2022-11-18 20:28:58,754 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/data/d69b41798/441fdf62f8534171a735a6a1d8d30632 [2022-11-18 20:28:58,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:28:58,759 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:28:58,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:28:58,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:28:58,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:28:58,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:28:58" (1/1) ... [2022-11-18 20:28:58,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17258b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:28:58, skipping insertion in model container [2022-11-18 20:28:58,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:28:58" (1/1) ... [2022-11-18 20:28:58,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:28:58,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:28:58,976 WARN L234 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_73805816-33c3-47e6-a679-e27cb39403e5/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-11-18 20:28:58,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:28:58,999 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:28:59,011 WARN L234 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_73805816-33c3-47e6-a679-e27cb39403e5/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-11-18 20:28:59,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:28:59,028 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:28:59,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:28:59 WrapperNode [2022-11-18 20:28:59,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:28:59,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:28:59,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:28:59,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:28:59,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:28:59" (1/1) ... [2022-11-18 20:28:59,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:28:59" (1/1) ... [2022-11-18 20:28:59,062 INFO L138 Inliner]: procedures = 15, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-11-18 20:28:59,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:28:59,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:28:59,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:28:59,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:28:59,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:28:59" (1/1) ... [2022-11-18 20:28:59,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:28:59" (1/1) ... [2022-11-18 20:28:59,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:28:59" (1/1) ... [2022-11-18 20:28:59,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:28:59" (1/1) ... [2022-11-18 20:28:59,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:28:59" (1/1) ... [2022-11-18 20:28:59,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:28:59" (1/1) ... [2022-11-18 20:28:59,099 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:28:59" (1/1) ... [2022-11-18 20:28:59,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:28:59" (1/1) ... [2022-11-18 20:28:59,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:28:59,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:28:59,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:28:59,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:28:59,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:28:59" (1/1) ... [2022-11-18 20:28:59,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:28:59,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:28:59,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:28:59,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:28:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:28:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:28:59,189 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:28:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:28:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:28:59,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:28:59,267 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:28:59,270 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:28:59,449 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:28:59,455 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:28:59,455 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 20:28:59,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:28:59 BoogieIcfgContainer [2022-11-18 20:28:59,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:28:59,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:28:59,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:28:59,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:28:59,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:28:58" (1/3) ... [2022-11-18 20:28:59,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219c1bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:28:59, skipping insertion in model container [2022-11-18 20:28:59,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:28:59" (2/3) ... [2022-11-18 20:28:59,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219c1bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:28:59, skipping insertion in model container [2022-11-18 20:28:59,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:28:59" (3/3) ... [2022-11-18 20:28:59,468 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_reinit.c [2022-11-18 20:28:59,495 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:28:59,496 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:28:59,577 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:28:59,589 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;@3081d94c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:28:59,589 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:28:59,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:28:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:28:59,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:28:59,605 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:28:59,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:28:59,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:59,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1343975806, now seen corresponding path program 1 times [2022-11-18 20:28:59,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:28:59,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011796653] [2022-11-18 20:28:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:28:59,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:28:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:28:59,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:28:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:28:59,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:28:59,896 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:28:59,898 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:28:59,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:28:59,905 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-18 20:28:59,910 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:28:59,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:28:59 BoogieIcfgContainer [2022-11-18 20:28:59,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:28:59,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:28:59,950 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:28:59,951 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:28:59,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:28:59" (3/4) ... [2022-11-18 20:28:59,956 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:28:59,957 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:28:59,958 INFO L158 Benchmark]: Toolchain (without parser) took 1199.24ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 63.8MB in the end (delta: 18.1MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-11-18 20:28:59,959 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:28:59,961 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.16ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 93.7MB in the end (delta: -12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:28:59,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.35ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 92.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:28:59,964 INFO L158 Benchmark]: Boogie Preprocessor took 41.19ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 91.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:28:59,969 INFO L158 Benchmark]: RCFGBuilder took 352.79ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 81.1MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:28:59,970 INFO L158 Benchmark]: TraceAbstraction took 487.81ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 63.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-18 20:28:59,970 INFO L158 Benchmark]: Witness Printer took 7.02ms. Allocated memory is still 117.4MB. Free memory is still 63.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:28:59,977 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.30ms. Allocated memory is still 117.4MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.16ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 93.7MB in the end (delta: -12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.35ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 92.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.19ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 91.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 352.79ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 81.1MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 487.81ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 63.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 7.02ms. Allocated memory is still 117.4MB. Free memory is still 63.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of to_real at line 31, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L23] double E, E0, E1, S0, S1, S; [L24] int i; [L26] E = __VERIFIER_nondet_double() [L27] E0 = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L16] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(E >= 0. && E <= 1.) [L29] CALL assume_abort_if_not(E0 >= 0. && E0 <= 1.) VAL [\old(cond)=1] [L16] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L29] RET assume_abort_if_not(E0 >= 0. && E0 <= 1.) [L31] S0 = 0 [L32] S = 0 [L34] i = 0 VAL [i=0] [L34] COND TRUE i <= 1000000 [L36] E1 = E0 [L37] E0 = E [L39] E = __VERIFIER_nondet_double() [L40] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L16] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L40] RET assume_abort_if_not(E >= 0. && E <= 1.) VAL [E=55, E=54, E=53, i=0] [L42] COND TRUE __VERIFIER_nondet_int() [L43] E1 = E [L44] E0 = E [L45] S0 = E [L46] S = E VAL [E=54, E=54, E=54, i=0, S=54, S0=54] [L49] S1 = S0 [L50] S0 = S [L51] S = 0.7*E - E0*1.3 + E1*1.1 + S0*1.4 - S1*0.7 [L53] CALL __VERIFIER_assert(S >= -4. && S <= 4.) [L18] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L18] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 20:29:00,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_reinit.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro --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 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 --- 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-8393723 [2022-11-18 20:29:02,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:29:02,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:29:02,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:29:02,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:29:02,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:29:02,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:29:02,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:29:02,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:29:02,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:29:02,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:29:02,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:29:02,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:29:02,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:29:02,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:29:02,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:29:02,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:29:02,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:29:02,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:29:02,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:29:02,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:29:02,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:29:02,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:29:02,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:29:02,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:29:02,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:29:02,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:29:02,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:29:02,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:29:02,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:29:02,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:29:02,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:29:02,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:29:02,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:29:02,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:29:02,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:29:02,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:29:02,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:29:02,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:29:02,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:29:02,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:29:02,334 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-18 20:29:02,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:29:02,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:29:02,380 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:29:02,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:29:02,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:29:02,383 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:29:02,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:29:02,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:29:02,385 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:29:02,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:29:02,386 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:29:02,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:29:02,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:29:02,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:29:02,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:29:02,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:29:02,388 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:29:02,388 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:29:02,388 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:29:02,388 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:29:02,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:29:02,389 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:29:02,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:29:02,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:29:02,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:29:02,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:29:02,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:29:02,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:29:02,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:29:02,391 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:29:02,391 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:29:02,391 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:29:02,391 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:29:02,392 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:29:02,392 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:29:02,392 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:29:02,392 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_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/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_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro 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 -> 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 [2022-11-18 20:29:02,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:29:02,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:29:02,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:29:02,829 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:29:02,830 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:29:02,832 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-11-18 20:29:02,908 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/data/adfa74bea/0dbcd6d259714b429f392ec82c5bae2d/FLAG02bfb6b2b [2022-11-18 20:29:03,549 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:29:03,550 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-11-18 20:29:03,557 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/data/adfa74bea/0dbcd6d259714b429f392ec82c5bae2d/FLAG02bfb6b2b [2022-11-18 20:29:03,875 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/data/adfa74bea/0dbcd6d259714b429f392ec82c5bae2d [2022-11-18 20:29:03,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:29:03,882 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:29:03,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:29:03,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:29:03,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:29:03,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:29:03" (1/1) ... [2022-11-18 20:29:03,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@280d4c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:03, skipping insertion in model container [2022-11-18 20:29:03,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:29:03" (1/1) ... [2022-11-18 20:29:03,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:29:03,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:29:04,139 WARN L234 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_73805816-33c3-47e6-a679-e27cb39403e5/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-11-18 20:29:04,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:29:04,192 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:29:04,226 WARN L234 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_73805816-33c3-47e6-a679-e27cb39403e5/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-11-18 20:29:04,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:29:04,282 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:29:04,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:04 WrapperNode [2022-11-18 20:29:04,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:29:04,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:29:04,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:29:04,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:29:04,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:04" (1/1) ... [2022-11-18 20:29:04,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:04" (1/1) ... [2022-11-18 20:29:04,351 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-11-18 20:29:04,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:29:04,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:29:04,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:29:04,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:29:04,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:04" (1/1) ... [2022-11-18 20:29:04,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:04" (1/1) ... [2022-11-18 20:29:04,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:04" (1/1) ... [2022-11-18 20:29:04,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:04" (1/1) ... [2022-11-18 20:29:04,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:04" (1/1) ... [2022-11-18 20:29:04,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:04" (1/1) ... [2022-11-18 20:29:04,393 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:04" (1/1) ... [2022-11-18 20:29:04,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:04" (1/1) ... [2022-11-18 20:29:04,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:29:04,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:29:04,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:29:04,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:29:04,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:04" (1/1) ... [2022-11-18 20:29:04,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:29:04,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:29:04,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:29:04,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:29:04,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:29:04,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:29:04,471 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:29:04,471 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:29:04,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:29:04,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:29:04,543 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:29:04,546 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:29:06,991 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:29:06,998 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:29:06,999 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 20:29:07,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:29:07 BoogieIcfgContainer [2022-11-18 20:29:07,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:29:07,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:29:07,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:29:07,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:29:07,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:29:03" (1/3) ... [2022-11-18 20:29:07,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db094e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:29:07, skipping insertion in model container [2022-11-18 20:29:07,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:04" (2/3) ... [2022-11-18 20:29:07,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db094e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:29:07, skipping insertion in model container [2022-11-18 20:29:07,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:29:07" (3/3) ... [2022-11-18 20:29:07,011 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_reinit.c [2022-11-18 20:29:07,031 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:29:07,031 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:29:07,083 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:29:07,091 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;@6b297d5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:29:07,091 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:29:07,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:29:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 20:29:07,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:07,107 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:29:07,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:29:07,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:07,114 INFO L85 PathProgramCache]: Analyzing trace with hash 526466326, now seen corresponding path program 1 times [2022-11-18 20:29:07,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:29:07,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14114488] [2022-11-18 20:29:07,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:29:07,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:29:07,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:29:07,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:29:07,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-18 20:29:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:29:08,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 20:29:08,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:29:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 20:29:08,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:29:08,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:29:08,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14114488] [2022-11-18 20:29:08,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14114488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:29:08,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:29:08,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:29:08,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391596792] [2022-11-18 20:29:08,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:29:08,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:29:08,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:29:08,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:29:08,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:29:08,669 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:29:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:29:08,689 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-11-18 20:29:08,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:29:08,692 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-11-18 20:29:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:29:08,700 INFO L225 Difference]: With dead ends: 41 [2022-11-18 20:29:08,700 INFO L226 Difference]: Without dead ends: 18 [2022-11-18 20:29:08,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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-18 20:29:08,707 INFO L413 NwaCegarLoop]: 25 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, 25 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-18 20:29:08,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:29:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-18 20:29:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-18 20:29:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:29:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-18 20:29:08,745 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 23 [2022-11-18 20:29:08,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:29:08,746 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-18 20:29:08,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:29:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-18 20:29:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 20:29:08,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:08,748 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:29:08,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-18 20:29:08,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:29:08,963 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:29:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:08,964 INFO L85 PathProgramCache]: Analyzing trace with hash -398587304, now seen corresponding path program 1 times [2022-11-18 20:29:08,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:29:08,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578906741] [2022-11-18 20:29:08,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:29:08,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:29:08,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:29:08,968 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:29:08,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-18 20:29:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:29:23,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-18 20:29:23,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:29:59,218 WARN L837 $PredicateComparison]: unable to prove that (or (and (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2022-11-18 20:30:31,059 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from false [2022-11-18 20:30:33,113 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from true [2022-11-18 20:30:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 20:30:33,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:30:33,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:30:33,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578906741] [2022-11-18 20:30:33,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578906741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:33,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:33,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:30:33,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284340114] [2022-11-18 20:30:33,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:33,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:30:33,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:30:33,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:30:33,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=27, Unknown=3, NotChecked=22, Total=72 [2022-11-18 20:30:33,119 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:30:36,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:30:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:36,614 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-11-18 20:30:36,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:30:36,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-11-18 20:30:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:36,616 INFO L225 Difference]: With dead ends: 30 [2022-11-18 20:30:36,617 INFO L226 Difference]: Without dead ends: 28 [2022-11-18 20:30:36,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=25, Invalid=36, Unknown=3, NotChecked=26, Total=90 [2022-11-18 20:30:36,619 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:36,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 43 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 1 Unknown, 32 Unchecked, 3.4s Time] [2022-11-18 20:30:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-18 20:30:36,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-11-18 20:30:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:30:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-18 20:30:36,629 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-11-18 20:30:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:36,630 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-18 20:30:36,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:30:36,631 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-18 20:30:36,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 20:30:36,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:36,632 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:36,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-18 20:30:36,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:30:36,844 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:36,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:36,846 INFO L85 PathProgramCache]: Analyzing trace with hash -398527722, now seen corresponding path program 1 times [2022-11-18 20:30:36,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:30:36,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745479382] [2022-11-18 20:30:36,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:36,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:30:36,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:30:36,849 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:30:36,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-18 20:30:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:48,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 20:30:48,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:33:34,490 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 4.0))) (let ((.cse3 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse7 (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse8 (fp.mul roundNearestTiesToEven .cse9 .cse4)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse5)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse6)) .cse7) .cse8))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0) (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse5)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse6)) .cse7) .cse8) .cse3)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse5)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse6)) .cse7) .cse8) .cse2)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2022-11-18 20:34:06,224 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse3 (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 .cse0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) (fp.neg .cse5))) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6))) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) .cse5)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6)))))))) is different from false [2022-11-18 20:34:08,273 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse3 (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 .cse0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) (fp.neg .cse5))) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6))) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) .cse5)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6)))))))) is different from true [2022-11-18 20:34:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:34:08,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:08,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:34:08,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745479382] [2022-11-18 20:34:08,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745479382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:08,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:08,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:34:08,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264883904] [2022-11-18 20:34:08,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:08,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:34:08,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:34:08,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:34:08,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=60, Unknown=3, NotChecked=34, Total=132 [2022-11-18 20:34:08,278 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:34:11,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:34:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:11,905 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-11-18 20:34:11,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:34:11,907 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2022-11-18 20:34:11,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:11,908 INFO L225 Difference]: With dead ends: 31 [2022-11-18 20:34:11,908 INFO L226 Difference]: Without dead ends: 29 [2022-11-18 20:34:11,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=40, Invalid=75, Unknown=3, NotChecked=38, Total=156 [2022-11-18 20:34:11,909 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:11,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 71 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 1 Unknown, 36 Unchecked, 3.5s Time] [2022-11-18 20:34:11,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-18 20:34:11,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-18 20:34:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:34:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-18 20:34:11,917 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-11-18 20:34:11,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:11,917 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-18 20:34:11,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:34:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-18 20:34:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 20:34:11,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:11,920 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:34:11,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-18 20:34:12,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:34:12,127 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:12,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash 497959587, now seen corresponding path program 1 times [2022-11-18 20:34:12,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:34:12,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353452390] [2022-11-18 20:34:12,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:12,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:34:12,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:34:12,134 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:34:12,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-18 20:34:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-18 20:34:27,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:35:03,526 WARN L837 $PredicateComparison]: unable to prove that (or (and (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2022-11-18 20:35:33,757 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from false [2022-11-18 20:35:35,813 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from true [2022-11-18 20:35:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 1 not checked. [2022-11-18 20:35:35,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:35:47,777 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-11-18 20:35:49,986 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2022-11-18 20:36:01,170 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2022-11-18 20:36:03,307 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2022-11-18 20:36:32,163 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 4.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) .cse4) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))) (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) (fp.neg .cse4)) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))))) is different from false [2022-11-18 20:36:34,447 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 4.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) .cse4) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))) (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) (fp.neg .cse4)) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))))) is different from true [2022-11-18 20:36:34,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:36:34,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353452390] [2022-11-18 20:36:34,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353452390] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:34,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [119893425] [2022-11-18 20:36:34,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:34,450 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:36:34,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:36:34,454 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:36:34,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-18 20:36:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-18 20:36:48,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:34,935 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0))) (.cse1 (fp.neg .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse5)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse6)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse4)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse5)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse6)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse4)) .cse2)))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse5)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse6)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse4)) .cse1)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-18 20:37:37,001 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0))) (.cse1 (fp.neg .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse5)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse6)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse4)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse5)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse6)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse4)) .cse2)))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse5)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse6)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse4)) .cse1)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-18 20:37:56,587 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-18 20:39:26,392 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_assume_abort_if_not_#in~cond| c_assume_abort_if_not_~cond) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-18 20:39:45,985 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from false [2022-11-18 20:40:39,910 WARN L233 SmtUtils]: Spent 11.09s on a formula simplification. DAG size of input: 37 DAG size of output: 10 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:41:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 15 not checked. [2022-11-18 20:41:42,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:42:28,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [119893425] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:42:28,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:42:28,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 12 [2022-11-18 20:42:28,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641369368] [2022-11-18 20:42:28,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:42:28,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:42:28,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:42:28,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:42:28,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=18, NotChecked=198, Total=306 [2022-11-18 20:42:28,673 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:42:32,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:42:34,663 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (.cse6 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))) (and (or (and (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) .cse6) .cse7) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (let ((.cse13 ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0))) (.cse14 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (.cse15 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0))) (.cse12 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0))) (.cse9 (fp.neg .cse10)) (.cse11 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (and .cse7 (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse8 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse12 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse13)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse14)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse15)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse12)))) (and (fp.geq .cse8 .cse9) (fp.leq .cse8 .cse10) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse11) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) (and .cse6 (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse11) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse12 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse13)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse14)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse15)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse12)) .cse10)))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse12 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse13)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse14)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse15)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse12)) .cse9)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse11) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-18 20:42:37,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:42:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:42:37,375 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-11-18 20:42:37,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:42:37,579 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-11-18 20:42:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:42:37,581 INFO L225 Difference]: With dead ends: 41 [2022-11-18 20:42:37,581 INFO L226 Difference]: Without dead ends: 39 [2022-11-18 20:42:37,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 54.5s TimeCoverageRelationStatistics Valid=47, Invalid=64, Unknown=19, NotChecked=250, Total=380 [2022-11-18 20:42:37,583 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:42:37,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 38 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 2 Unknown, 132 Unchecked, 6.0s Time] [2022-11-18 20:42:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-18 20:42:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2022-11-18 20:42:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:42:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-18 20:42:37,591 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 34 [2022-11-18 20:42:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:42:37,591 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-18 20:42:37,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:42:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-18 20:42:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 20:42:37,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:42:37,593 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:42:37,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:42:37,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:42:37,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 20:42:37,994 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:42:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:42:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash 498019169, now seen corresponding path program 1 times [2022-11-18 20:42:37,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:42:37,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145986781] [2022-11-18 20:42:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:42:37,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:42:37,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:42:37,996 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:42:37,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73805816-33c3-47e6-a679-e27cb39403e5/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process