./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8 --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 e42e84729022b725ebcfce66d0ece68757a1a9b385230356b4d45a24fc6b4ef2 --- 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-2329fc7 [2022-12-13 22:09:42,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:09:42,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:09:42,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:09:42,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:09:42,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:09:42,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:09:42,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:09:42,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:09:42,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:09:42,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:09:42,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:09:42,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:09:42,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:09:42,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:09:42,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:09:42,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:09:42,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:09:42,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:09:42,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:09:42,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:09:42,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:09:42,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:09:42,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:09:42,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:09:42,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:09:42,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:09:42,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:09:42,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:09:42,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:09:42,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:09:42,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:09:42,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:09:42,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:09:42,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:09:42,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:09:42,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:09:42,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:09:42,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:09:42,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:09:42,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:09:42,203 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 22:09:42,221 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:09:42,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:09:42,221 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:09:42,221 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:09:42,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:09:42,222 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:09:42,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:09:42,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:09:42,223 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:09:42,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:09:42,223 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 22:09:42,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:09:42,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 22:09:42,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:09:42,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 22:09:42,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:09:42,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 22:09:42,224 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 22:09:42,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 22:09:42,225 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:09:42,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 22:09:42,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:09:42,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:09:42,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:09:42,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:09:42,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:09:42,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:09:42,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 22:09:42,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 22:09:42,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 22:09:42,227 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:09:42,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 22:09:42,227 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:09:42,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:09:42,227 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:09:42,227 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/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_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8 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 -> e42e84729022b725ebcfce66d0ece68757a1a9b385230356b4d45a24fc6b4ef2 [2022-12-13 22:09:42,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:09:42,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:09:42,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:09:42,459 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:09:42,460 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:09:42,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/filter2.c [2022-12-13 22:09:45,093 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:09:45,220 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:09:45,220 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/sv-benchmarks/c/float-benchs/filter2.c [2022-12-13 22:09:45,226 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/data/2cafafc1b/dde18db8193f4f58a09e7be14a5dfde3/FLAG6db37f7cd [2022-12-13 22:09:45,237 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/data/2cafafc1b/dde18db8193f4f58a09e7be14a5dfde3 [2022-12-13 22:09:45,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:09:45,241 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:09:45,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:09:45,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:09:45,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:09:45,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:09:45" (1/1) ... [2022-12-13 22:09:45,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd05704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:45, skipping insertion in model container [2022-12-13 22:09:45,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:09:45" (1/1) ... [2022-12-13 22:09:45,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:09:45,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:09:45,366 WARN L237 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_70e6bd74-df60-4606-9c5d-ffe715a0d486/sv-benchmarks/c/float-benchs/filter2.c[652,665] [2022-12-13 22:09:45,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:09:45,386 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:09:45,396 WARN L237 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_70e6bd74-df60-4606-9c5d-ffe715a0d486/sv-benchmarks/c/float-benchs/filter2.c[652,665] [2022-12-13 22:09:45,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:09:45,410 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:09:45,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:45 WrapperNode [2022-12-13 22:09:45,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:09:45,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:09:45,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:09:45,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:09:45,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:45" (1/1) ... [2022-12-13 22:09:45,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:45" (1/1) ... [2022-12-13 22:09:45,435 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 50 [2022-12-13 22:09:45,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:09:45,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:09:45,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:09:45,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:09:45,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:45" (1/1) ... [2022-12-13 22:09:45,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:45" (1/1) ... [2022-12-13 22:09:45,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:45" (1/1) ... [2022-12-13 22:09:45,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:45" (1/1) ... [2022-12-13 22:09:45,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:45" (1/1) ... [2022-12-13 22:09:45,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:45" (1/1) ... [2022-12-13 22:09:45,450 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:45" (1/1) ... [2022-12-13 22:09:45,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:45" (1/1) ... [2022-12-13 22:09:45,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:09:45,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:09:45,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:09:45,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:09:45,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:45" (1/1) ... [2022-12-13 22:09:45,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:09:45,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:09:45,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:09:45,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:09:45,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:09:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 22:09:45,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 22:09:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 22:09:45,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:09:45,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:09:45,557 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:09:45,559 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:09:45,633 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:09:45,637 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:09:45,638 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 22:09:45,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:09:45 BoogieIcfgContainer [2022-12-13 22:09:45,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:09:45,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:09:45,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:09:45,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:09:45,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:09:45" (1/3) ... [2022-12-13 22:09:45,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf71c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:09:45, skipping insertion in model container [2022-12-13 22:09:45,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:45" (2/3) ... [2022-12-13 22:09:45,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf71c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:09:45, skipping insertion in model container [2022-12-13 22:09:45,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:09:45" (3/3) ... [2022-12-13 22:09:45,646 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2.c [2022-12-13 22:09:45,659 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:09:45,660 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 22:09:45,697 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:09:45,703 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;@a573ec0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:09:45,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 22:09:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 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-12-13 22:09:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 22:09:45,713 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:09:45,713 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:09:45,714 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:09:45,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:09:45,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1602622425, now seen corresponding path program 1 times [2022-12-13 22:09:45,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:09:45,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075623475] [2022-12-13 22:09:45,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:45,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:09:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:45,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:09:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:45,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 22:09:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:45,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 22:09:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:45,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 22:09:45,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:09:45,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075623475] [2022-12-13 22:09:45,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075623475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:09:45,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:09:45,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:09:45,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349972366] [2022-12-13 22:09:45,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:09:45,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 22:09:45,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:09:45,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 22:09:45,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 22:09:45,883 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 22:09:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:09:45,898 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-12-13 22:09:45,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 22:09:45,899 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 1 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 22 [2022-12-13 22:09:45,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:09:45,904 INFO L225 Difference]: With dead ends: 39 [2022-12-13 22:09:45,905 INFO L226 Difference]: Without dead ends: 17 [2022-12-13 22:09:45,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-12-13 22:09:45,909 INFO L413 NwaCegarLoop]: 23 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, 23 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-12-13 22:09:45,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:09:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-12-13 22:09:45,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-12-13 22:09:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-12-13 22:09:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-12-13 22:09:45,937 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 22 [2022-12-13 22:09:45,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:09:45,937 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-12-13 22:09:45,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 22:09:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-12-13 22:09:45,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 22:09:45,939 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:09:45,939 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:09:45,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 22:09:45,939 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:09:45,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:09:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash 168652453, now seen corresponding path program 1 times [2022-12-13 22:09:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:09:45,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811303135] [2022-12-13 22:09:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:45,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:09:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:09:45,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:09:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:09:45,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:09:45,994 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 22:09:45,996 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 22:09:45,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 22:09:46,001 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-12-13 22:09:46,004 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 22:09:46,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:09:46 BoogieIcfgContainer [2022-12-13 22:09:46,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 22:09:46,026 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 22:09:46,026 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 22:09:46,026 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 22:09:46,026 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:09:45" (3/4) ... [2022-12-13 22:09:46,029 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 22:09:46,029 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 22:09:46,030 INFO L158 Benchmark]: Toolchain (without parser) took 789.31ms. Allocated memory is still 130.0MB. Free memory was 98.5MB in the beginning and 47.8MB in the end (delta: 50.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2022-12-13 22:09:46,030 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 98.6MB. Free memory was 45.3MB in the beginning and 45.2MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:09:46,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.43ms. Allocated memory is still 130.0MB. Free memory was 98.5MB in the beginning and 88.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 22:09:46,038 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.88ms. Allocated memory is still 130.0MB. Free memory was 88.0MB in the beginning and 86.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:09:46,039 INFO L158 Benchmark]: Boogie Preprocessor took 15.49ms. Allocated memory is still 130.0MB. Free memory was 86.6MB in the beginning and 85.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:09:46,039 INFO L158 Benchmark]: RCFGBuilder took 187.23ms. Allocated memory is still 130.0MB. Free memory was 85.0MB in the beginning and 75.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 22:09:46,040 INFO L158 Benchmark]: TraceAbstraction took 384.39ms. Allocated memory is still 130.0MB. Free memory was 74.6MB in the beginning and 47.8MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 22:09:46,040 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 130.0MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:09:46,042 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.18ms. Allocated memory is still 98.6MB. Free memory was 45.3MB in the beginning and 45.2MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.43ms. Allocated memory is still 130.0MB. Free memory was 98.5MB in the beginning and 88.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.88ms. Allocated memory is still 130.0MB. Free memory was 88.0MB in the beginning and 86.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.49ms. Allocated memory is still 130.0MB. Free memory was 86.6MB in the beginning and 85.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 187.23ms. Allocated memory is still 130.0MB. Free memory was 85.0MB in the beginning and 75.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 384.39ms. Allocated memory is still 130.0MB. Free memory was 74.6MB in the beginning and 47.8MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 130.0MB. Free memory is still 47.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: 17]: 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 44, overapproximation of to_real at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 42. Possible FailurePath: [L22] double E, E0, E1, S0, S1, S; [L23] int i; [L25] E = __VERIFIER_nondet_double() [L26] E0 = __VERIFIER_nondet_double() [L27] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L27] RET assume_abort_if_not(E >= 0. && E <= 1.) [L28] CALL assume_abort_if_not(E0 >= 0. && E0 <= 1.) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(E0 >= 0. && E0 <= 1.) [L30] S0 = 0 [L31] S = 0 [L33] i = 0 VAL [i=0] [L33] COND TRUE i <= 1000000 [L34] E1 = E0 [L35] E0 = E [L37] E = __VERIFIER_nondet_double() [L38] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume_abort_if_not(E >= 0. && E <= 1.) VAL [E=56, E=53, E=54, i=0] [L40] S1 = S0 [L41] S0 = S [L42] S = 0.7*E - E0*1.3 + E1*1.1 + S0*1.4 - S1*0.7 [L44] CALL __VERIFIER_assert(S >= -4. && S <= 4.) [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 23 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 12/12 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-12-13 22:09:46,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8 --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 e42e84729022b725ebcfce66d0ece68757a1a9b385230356b4d45a24fc6b4ef2 --- 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-2329fc7 [2022-12-13 22:09:47,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:09:47,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:09:47,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:09:47,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:09:47,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:09:47,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:09:47,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:09:47,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:09:47,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:09:47,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:09:47,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:09:47,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:09:47,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:09:47,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:09:47,590 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:09:47,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:09:47,591 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:09:47,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:09:47,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:09:47,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:09:47,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:09:47,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:09:47,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:09:47,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:09:47,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:09:47,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:09:47,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:09:47,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:09:47,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:09:47,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:09:47,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:09:47,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:09:47,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:09:47,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:09:47,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:09:47,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:09:47,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:09:47,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:09:47,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:09:47,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:09:47,616 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-12-13 22:09:47,641 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:09:47,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:09:47,642 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:09:47,642 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:09:47,642 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:09:47,642 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:09:47,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:09:47,643 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:09:47,643 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:09:47,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:09:47,643 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 22:09:47,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 22:09:47,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:09:47,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 22:09:47,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:09:47,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 22:09:47,644 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 22:09:47,644 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 22:09:47,644 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 22:09:47,644 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 22:09:47,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 22:09:47,645 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:09:47,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 22:09:47,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:09:47,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:09:47,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:09:47,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:09:47,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:09:47,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:09:47,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 22:09:47,646 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 22:09:47,646 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 22:09:47,646 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:09:47,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 22:09:47,646 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:09:47,646 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:09:47,646 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 22:09:47,647 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:09:47,647 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/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_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8 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 -> e42e84729022b725ebcfce66d0ece68757a1a9b385230356b4d45a24fc6b4ef2 [2022-12-13 22:09:47,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:09:47,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:09:47,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:09:47,868 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:09:47,868 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:09:47,870 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/filter2.c [2022-12-13 22:09:50,494 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:09:50,626 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:09:50,626 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/sv-benchmarks/c/float-benchs/filter2.c [2022-12-13 22:09:50,631 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/data/2aa9ddb68/06185b7a47804716b207cd4f05339c5d/FLAGcd625f19e [2022-12-13 22:09:50,641 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/data/2aa9ddb68/06185b7a47804716b207cd4f05339c5d [2022-12-13 22:09:50,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:09:50,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:09:50,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:09:50,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:09:50,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:09:50,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:09:50" (1/1) ... [2022-12-13 22:09:50,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e76c88c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:50, skipping insertion in model container [2022-12-13 22:09:50,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:09:50" (1/1) ... [2022-12-13 22:09:50,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:09:50,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:09:50,768 WARN L237 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_70e6bd74-df60-4606-9c5d-ffe715a0d486/sv-benchmarks/c/float-benchs/filter2.c[652,665] [2022-12-13 22:09:50,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:09:50,790 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:09:50,800 WARN L237 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_70e6bd74-df60-4606-9c5d-ffe715a0d486/sv-benchmarks/c/float-benchs/filter2.c[652,665] [2022-12-13 22:09:50,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:09:50,814 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:09:50,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:50 WrapperNode [2022-12-13 22:09:50,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:09:50,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:09:50,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:09:50,816 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:09:50,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:50" (1/1) ... [2022-12-13 22:09:50,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:50" (1/1) ... [2022-12-13 22:09:50,841 INFO L138 Inliner]: procedures = 15, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2022-12-13 22:09:50,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:09:50,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:09:50,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:09:50,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:09:50,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:50" (1/1) ... [2022-12-13 22:09:50,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:50" (1/1) ... [2022-12-13 22:09:50,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:50" (1/1) ... [2022-12-13 22:09:50,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:50" (1/1) ... [2022-12-13 22:09:50,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:50" (1/1) ... [2022-12-13 22:09:50,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:50" (1/1) ... [2022-12-13 22:09:50,859 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:50" (1/1) ... [2022-12-13 22:09:50,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:50" (1/1) ... [2022-12-13 22:09:50,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:09:50,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:09:50,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:09:50,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:09:50,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:50" (1/1) ... [2022-12-13 22:09:50,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:09:50,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:09:50,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:09:50,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:09:50,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:09:50,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 22:09:50,933 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 22:09:50,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 22:09:50,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:09:50,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:09:50,989 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:09:50,991 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:09:53,286 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:09:53,291 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:09:53,291 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 22:09:53,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:09:53 BoogieIcfgContainer [2022-12-13 22:09:53,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:09:53,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:09:53,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:09:53,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:09:53,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:09:50" (1/3) ... [2022-12-13 22:09:53,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94ba3f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:09:53, skipping insertion in model container [2022-12-13 22:09:53,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:50" (2/3) ... [2022-12-13 22:09:53,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94ba3f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:09:53, skipping insertion in model container [2022-12-13 22:09:53,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:09:53" (3/3) ... [2022-12-13 22:09:53,300 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2.c [2022-12-13 22:09:53,316 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:09:53,316 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 22:09:53,350 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:09:53,355 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;@4ca2e78c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:09:53,356 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 22:09:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 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-12-13 22:09:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 22:09:53,367 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:09:53,367 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:09:53,368 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:09:53,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:09:53,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1602622425, now seen corresponding path program 1 times [2022-12-13 22:09:53,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:09:53,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864911846] [2022-12-13 22:09:53,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:53,387 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-12-13 22:09:53,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:09:53,388 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/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-12-13 22:09:53,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/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-12-13 22:09:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:54,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 22:09:54,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:09:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 22:09:54,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:09:54,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:09:54,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864911846] [2022-12-13 22:09:54,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864911846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:09:54,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:09:54,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:09:54,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814972779] [2022-12-13 22:09:54,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:09:54,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 22:09:54,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:09:54,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 22:09:54,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 22:09:54,708 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 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.0) internal successors, (12), 2 states have internal predecessors, (12), 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-12-13 22:09:54,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:09:54,728 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-12-13 22:09:54,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 22:09:54,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 22 [2022-12-13 22:09:54,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:09:54,737 INFO L225 Difference]: With dead ends: 39 [2022-12-13 22:09:54,737 INFO L226 Difference]: Without dead ends: 17 [2022-12-13 22:09:54,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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-12-13 22:09:54,743 INFO L413 NwaCegarLoop]: 23 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, 23 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-12-13 22:09:54,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:09:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-12-13 22:09:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-12-13 22:09:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-12-13 22:09:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-12-13 22:09:54,777 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 22 [2022-12-13 22:09:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:09:54,777 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-12-13 22:09:54,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-12-13 22:09:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-12-13 22:09:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 22:09:54,779 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:09:54,779 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:09:54,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 22:09:54,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/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-12-13 22:09:54,981 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:09:54,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:09:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash 168652453, now seen corresponding path program 1 times [2022-12-13 22:09:54,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:09:54,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605261062] [2022-12-13 22:09:54,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:54,987 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-12-13 22:09:54,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:09:54,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/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-12-13 22:09:54,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/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-12-13 22:10:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:03,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 22:10:03,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:12:47,273 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-12-13 22:13:18,845 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-12-13 22:13:20,886 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-12-13 22:13:20,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 22:13:20,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:13:20,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:13:20,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605261062] [2022-12-13 22:13:20,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605261062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:13:20,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:13:20,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 22:13:20,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625263486] [2022-12-13 22:13:20,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:13:20,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 22:13:20,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:13:20,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 22:13:20,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=60, Unknown=3, NotChecked=34, Total=132 [2022-12-13 22:13:20,890 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 12 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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-12-13 22:13:24,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 22:13:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:13:24,381 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-12-13 22:13:24,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 22:13:24,382 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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 22 [2022-12-13 22:13:24,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:13:24,383 INFO L225 Difference]: With dead ends: 27 [2022-12-13 22:13:24,383 INFO L226 Difference]: Without dead ends: 25 [2022-12-13 22:13:24,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=40, Invalid=75, Unknown=3, NotChecked=38, Total=156 [2022-12-13 22:13:24,386 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-13 22:13:24,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 1 Unknown, 31 Unchecked, 3.4s Time] [2022-12-13 22:13:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-13 22:13:24,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-12-13 22:13:24,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-12-13 22:13:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-12-13 22:13:24,392 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2022-12-13 22:13:24,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:13:24,392 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-12-13 22:13:24,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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-12-13 22:13:24,392 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-12-13 22:13:24,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 22:13:24,393 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:13:24,393 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:13:24,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/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-12-13 22:13:24,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/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-12-13 22:13:24,594 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 22:13:24,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:13:24,595 INFO L85 PathProgramCache]: Analyzing trace with hash -262310387, now seen corresponding path program 1 times [2022-12-13 22:13:24,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:13:24,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193494825] [2022-12-13 22:13:24,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:13:24,596 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-12-13 22:13:24,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:13:24,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/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-12-13 22:13:24,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70e6bd74-df60-4606-9c5d-ffe715a0d486/bin/uautomizer-uyxdKDjOR8/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-12-13 22:16:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:16:25,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 22:16:25,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:16:43,150 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= .cse0 |c_ULTIMATE.start_main_~S0~0#1|) (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| .cse1) (= |c_ULTIMATE.start_main_~S~0#1| (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 |ULTIMATE.start_main_~E1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) (fp.leq |c_ULTIMATE.start_main_~E~0#1| .cse1) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse1) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (let ((.cse3 (fp.leq |c_ULTIMATE.start_main_~S~0#1| .cse5)) (.cse4 (fp.geq |c_ULTIMATE.start_main_~S~0#1| (fp.neg .cse5)))) (or (and (or (not .cse3) (not .cse4)) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and .cse3 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse4)))) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |c_ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 22:16:58,375 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (= .cse0 |c_ULTIMATE.start_main_~S0~0#1|) (fp.leq |c_ULTIMATE.start_main_~S~0#1| .cse1) (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| .cse2) (= |c_ULTIMATE.start_main_~S~0#1| (let ((.cse3 ((_ 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 .cse3 |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 |ULTIMATE.start_main_~E1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode .cse0 .cse3)))))) (fp.leq |c_ULTIMATE.start_main_~E~0#1| .cse2) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse2) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |c_ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.geq |c_ULTIMATE.start_main_~S~0#1| (fp.neg .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 22:17:39,660 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (exists ((|v_ULTIMATE.start_main_~E1~0#1_5| (_ FloatingPoint 11 53))) (and (= (let ((.cse0 ((_ 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 .cse0 |c_ULTIMATE.start_main_~E0~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~E1~0#1_5| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode .cse1 .cse0))) |c_ULTIMATE.start_main_~S~0#1|) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_5| .cse2) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_5| (_ +zero 11 53)))) (= .cse1 |c_ULTIMATE.start_main_~S0~0#1|) (fp.leq |c_ULTIMATE.start_main_~S~0#1| .cse3) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse2) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |c_ULTIMATE.start_main_~S~0#1| (fp.neg .cse3)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 22:18:17,001 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~E1~0#1_5| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse3 ((_ 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 .cse3 |v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3|) (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~E1~0#1_5| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode .cse4 .cse3)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| (_ +zero 11 53)) (fp.leq .cse0 .cse1) (fp.leq |v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3| .cse2) (fp.geq .cse0 (fp.neg .cse1)) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| .cse2) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_5| .cse2) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_5| (_ +zero 11 53)) (fp.geq |v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-12-13 22:18:19,050 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~E1~0#1_5| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse3 ((_ 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 .cse3 |v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3|) (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~E1~0#1_5| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode .cse4 .cse3)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| (_ +zero 11 53)) (fp.leq .cse0 .cse1) (fp.leq |v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3| .cse2) (fp.geq .cse0 (fp.neg .cse1)) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| .cse2) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_5| .cse2) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_5| (_ +zero 11 53)) (fp.geq |v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-12-13 22:18:56,357 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~E1~0#1_5| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse3 ((_ 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 .cse3 |v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3|) (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~E1~0#1_5| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode .cse4 .cse3)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| (_ +zero 11 53)) (fp.leq .cse0 .cse1) (fp.leq |v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3| .cse2) (fp.geq .cse0 (fp.neg .cse1)) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| .cse2) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_5| .cse2) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_5| (_ +zero 11 53)) (fp.geq |v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3| (_ +zero 11 53))))) (= |c_assume_abort_if_not_#in~cond| c_assume_abort_if_not_~cond) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-12-13 22:19:33,721 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~E1~0#1_5| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse3 ((_ 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 .cse3 |v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3|) (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~E1~0#1_5| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode .cse4 .cse3)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| (_ +zero 11 53)) (fp.leq .cse0 .cse1) (fp.leq |v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3| .cse2) (fp.geq .cse0 (fp.neg .cse1)) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| .cse2) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_5| .cse2) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_5| (_ +zero 11 53)) (fp.geq |v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from false [2022-12-13 22:20:59,742 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 4.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (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))) (.cse4 (fp.mul c_currentRoundingMode .cse6 .cse0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse9 (fp.neg .cse7))) (and (exists ((|v_ULTIMATE.start_main_~E1~0#1_5| (_ FloatingPoint 11 53))) (and (= (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~E0~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E1~0#1| .cse1)) (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~E1~0#1_5| .cse2)) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S0~0#1| .cse3)) .cse4) |c_ULTIMATE.start_main_~S~0#1|) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_5| .cse5) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_5| (_ +zero 11 53)))) (= .cse6 |c_ULTIMATE.start_main_~S0~0#1|) (fp.leq |c_ULTIMATE.start_main_~S~0#1| .cse7) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse5) (exists ((|v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3| (_ 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 .cse0 |v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3|) (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| .cse1)) (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~E1~0#1_6| .cse2)) (fp.mul c_currentRoundingMode .cse6 .cse3)) .cse4))) (and (fp.geq |v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| (_ +zero 11 53)) (fp.leq |v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3| .cse5) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse5) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_BEFORE_CALL_3| .cse5) (fp.geq |v_ULTIMATE.start_main_~E0~0#1_BEFORE_CALL_3| (_ +zero 11 53)) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)) (fp.leq .cse8 .cse7) (fp.geq .cse8 .cse9)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |c_ULTIMATE.start_main_~E~0#1| .cse5) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse5) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |c_ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.geq |c_ULTIMATE.start_main_~S~0#1| .cse9) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false