./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter2_reinit.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_reinit.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:49:23,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:49:23,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:49:23,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:49:23,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:49:23,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:49:23,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:49:23,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:49:23,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:49:23,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:49:23,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:49:23,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:49:23,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:49:23,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:49:23,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:49:23,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:49:23,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:49:23,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:49:23,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:49:23,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:49:23,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:49:23,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:49:23,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:49:23,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:49:23,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:49:23,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:49:23,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:49:23,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:49:23,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:49:23,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:49:23,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:49:23,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:49:23,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:49:23,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:49:23,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:49:23,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:49:23,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:49:23,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:49:23,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:49:23,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:49:23,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:49:23,353 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:49:23,405 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:49:23,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:49:23,408 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:49:23,409 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:49:23,410 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:49:23,410 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:49:23,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:49:23,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:49:23,412 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:49:23,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:49:23,414 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:49:23,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:49:23,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:49:23,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:49:23,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:49:23,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:49:23,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:49:23,416 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:49:23,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:49:23,417 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:49:23,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:49:23,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:49:23,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:49:23,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:49:23,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:49:23,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:49:23,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:49:23,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:49:23,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:49:23,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:49:23,420 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:49:23,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:49:23,421 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:49:23,421 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:49:23,422 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_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/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_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 [2022-11-25 17:49:23,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:49:23,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:49:23,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:49:23,768 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:49:23,769 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:49:23,770 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-11-25 17:49:27,567 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:49:27,800 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:49:27,801 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-11-25 17:49:27,809 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/data/8d9123bd2/8b27066be8a64127a99ce0a9cddda79f/FLAG55d57bf2c [2022-11-25 17:49:27,828 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/data/8d9123bd2/8b27066be8a64127a99ce0a9cddda79f [2022-11-25 17:49:27,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:49:27,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:49:27,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:49:27,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:49:27,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:49:27,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:49:27" (1/1) ... [2022-11-25 17:49:27,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d7ed3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:27, skipping insertion in model container [2022-11-25 17:49:27,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:49:27" (1/1) ... [2022-11-25 17:49:27,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:49:27,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:49:28,067 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_1760b388-ccb2-42fd-9764-c2bc1969cab9/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-11-25 17:49:28,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:49:28,109 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:49:28,126 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_1760b388-ccb2-42fd-9764-c2bc1969cab9/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-11-25 17:49:28,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:49:28,150 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:49:28,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:28 WrapperNode [2022-11-25 17:49:28,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:49:28,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:49:28,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:49:28,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:49:28,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:28" (1/1) ... [2022-11-25 17:49:28,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:28" (1/1) ... [2022-11-25 17:49:28,189 INFO L138 Inliner]: procedures = 15, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-11-25 17:49:28,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:49:28,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:49:28,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:49:28,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:49:28,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:28" (1/1) ... [2022-11-25 17:49:28,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:28" (1/1) ... [2022-11-25 17:49:28,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:28" (1/1) ... [2022-11-25 17:49:28,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:28" (1/1) ... [2022-11-25 17:49:28,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:28" (1/1) ... [2022-11-25 17:49:28,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:28" (1/1) ... [2022-11-25 17:49:28,217 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:28" (1/1) ... [2022-11-25 17:49:28,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:28" (1/1) ... [2022-11-25 17:49:28,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:49:28,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:49:28,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:49:28,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:49:28,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:28" (1/1) ... [2022-11-25 17:49:28,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:49:28,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:28,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:28,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:49:28,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:49:28,317 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 17:49:28,318 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 17:49:28,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:49:28,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:49:28,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:49:28,413 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:49:28,416 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:49:28,572 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:49:28,579 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:49:28,580 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 17:49:28,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:49:28 BoogieIcfgContainer [2022-11-25 17:49:28,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:49:28,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:49:28,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:49:28,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:49:28,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:49:27" (1/3) ... [2022-11-25 17:49:28,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7cc7d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:49:28, skipping insertion in model container [2022-11-25 17:49:28,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:28" (2/3) ... [2022-11-25 17:49:28,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7cc7d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:49:28, skipping insertion in model container [2022-11-25 17:49:28,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:49:28" (3/3) ... [2022-11-25 17:49:28,595 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_reinit.c [2022-11-25 17:49:28,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:49:28,620 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:49:28,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:49:28,718 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;@24c86e3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:49:28,719 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:49:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:49:28,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 17:49:28,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:49:28,742 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:49:28,743 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:49:28,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:28,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1343975806, now seen corresponding path program 1 times [2022-11-25 17:49:28,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:49:28,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045640538] [2022-11-25 17:49:28,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:28,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:49:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:28,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:49:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:28,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:49:28,982 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:49:28,984 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 17:49:28,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:49:28,994 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-11-25 17:49:28,999 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:49:29,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:49:29 BoogieIcfgContainer [2022-11-25 17:49:29,052 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:49:29,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:49:29,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:49:29,057 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:49:29,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:49:28" (3/4) ... [2022-11-25 17:49:29,068 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:49:29,068 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:49:29,070 INFO L158 Benchmark]: Toolchain (without parser) took 1235.12ms. Allocated memory is still 151.0MB. Free memory was 108.4MB in the beginning and 69.1MB in the end (delta: 39.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-25 17:49:29,072 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 151.0MB. Free memory was 93.6MB in the beginning and 93.4MB in the end (delta: 168.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:49:29,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.18ms. Allocated memory is still 151.0MB. Free memory was 108.4MB in the beginning and 97.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:49:29,074 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.57ms. Allocated memory is still 151.0MB. Free memory was 97.9MB in the beginning and 96.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:49:29,075 INFO L158 Benchmark]: Boogie Preprocessor took 29.78ms. Allocated memory is still 151.0MB. Free memory was 96.4MB in the beginning and 95.4MB in the end (delta: 938.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:49:29,075 INFO L158 Benchmark]: RCFGBuilder took 361.58ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 85.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:49:29,076 INFO L158 Benchmark]: TraceAbstraction took 465.58ms. Allocated memory is still 151.0MB. Free memory was 84.4MB in the beginning and 69.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 17:49:29,077 INFO L158 Benchmark]: Witness Printer took 13.90ms. Allocated memory is still 151.0MB. Free memory was 69.1MB in the beginning and 69.1MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:49:29,081 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 151.0MB. Free memory was 93.6MB in the beginning and 93.4MB in the end (delta: 168.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.18ms. Allocated memory is still 151.0MB. Free memory was 108.4MB in the beginning and 97.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.57ms. Allocated memory is still 151.0MB. Free memory was 97.9MB in the beginning and 96.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.78ms. Allocated memory is still 151.0MB. Free memory was 96.4MB in the beginning and 95.4MB in the end (delta: 938.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 361.58ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 85.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 465.58ms. Allocated memory is still 151.0MB. Free memory was 84.4MB in the beginning and 69.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 13.90ms. Allocated memory is still 151.0MB. Free memory was 69.1MB in the beginning and 69.1MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of to_real at line 31, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L23] double E, E0, E1, S0, S1, S; [L24] int i; [L26] E = __VERIFIER_nondet_double() [L27] E0 = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L16] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(E >= 0. && E <= 1.) [L29] CALL assume_abort_if_not(E0 >= 0. && E0 <= 1.) VAL [\old(cond)=1] [L16] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L29] RET assume_abort_if_not(E0 >= 0. && E0 <= 1.) [L31] S0 = 0 [L32] S = 0 [L34] i = 0 VAL [i=0] [L34] COND TRUE i <= 1000000 [L36] E1 = E0 [L37] E0 = E [L39] E = __VERIFIER_nondet_double() [L40] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L16] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L40] RET assume_abort_if_not(E >= 0. && E <= 1.) VAL [E=53, E=55, E=54, i=0] [L42] COND TRUE __VERIFIER_nondet_int() [L43] E1 = E [L44] E0 = E [L45] S0 = E [L46] S = E VAL [E=54, E=54, E=54, i=0, S=54, S0=54] [L49] S1 = S0 [L50] S0 = S [L51] S = 0.7*E - E0*1.3 + E1*1.1 + S0*1.4 - S1*0.7 [L53] CALL __VERIFIER_assert(S >= -4. && S <= 4.) [L18] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L18] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:49:29,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_reinit.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:49:32,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:49:32,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:49:32,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:49:32,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:49:32,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:49:32,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:49:32,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:49:32,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:49:32,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:49:32,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:49:32,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:49:32,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:49:32,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:49:32,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:49:32,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:49:32,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:49:32,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:49:32,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:49:32,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:49:32,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:49:32,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:49:32,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:49:32,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:49:32,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:49:32,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:49:32,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:49:32,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:49:32,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:49:32,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:49:32,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:49:32,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:49:32,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:49:32,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:49:32,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:49:32,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:49:32,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:49:32,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:49:32,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:49:32,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:49:32,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:49:32,308 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-25 17:49:32,369 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:49:32,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:49:32,370 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:49:32,375 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:49:32,376 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:49:32,377 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:49:32,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:49:32,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:49:32,378 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:49:32,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:49:32,380 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:49:32,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:49:32,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:49:32,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:49:32,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:49:32,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:49:32,382 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:49:32,382 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:49:32,382 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:49:32,382 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:49:32,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:49:32,383 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:49:32,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:49:32,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:49:32,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:49:32,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:49:32,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:49:32,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:49:32,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:49:32,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:49:32,386 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:49:32,386 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:49:32,387 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:49:32,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:49:32,387 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:49:32,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:49:32,388 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:49:32,388 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_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/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_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 [2022-11-25 17:49:32,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:49:32,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:49:32,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:49:32,907 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:49:32,908 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:49:32,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-11-25 17:49:36,809 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:49:37,083 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:49:37,083 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-11-25 17:49:37,091 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/data/7bfc08390/20c02c87439346d9a677102edda2706d/FLAG7e44a021d [2022-11-25 17:49:37,107 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/data/7bfc08390/20c02c87439346d9a677102edda2706d [2022-11-25 17:49:37,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:49:37,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:49:37,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:49:37,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:49:37,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:49:37,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:49:37" (1/1) ... [2022-11-25 17:49:37,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a0a3d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:37, skipping insertion in model container [2022-11-25 17:49:37,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:49:37" (1/1) ... [2022-11-25 17:49:37,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:49:37,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:49:37,375 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_1760b388-ccb2-42fd-9764-c2bc1969cab9/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-11-25 17:49:37,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:49:37,432 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:49:37,459 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_1760b388-ccb2-42fd-9764-c2bc1969cab9/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-11-25 17:49:37,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:49:37,500 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:49:37,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:37 WrapperNode [2022-11-25 17:49:37,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:49:37,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:49:37,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:49:37,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:49:37,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:37" (1/1) ... [2022-11-25 17:49:37,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:37" (1/1) ... [2022-11-25 17:49:37,583 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-11-25 17:49:37,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:49:37,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:49:37,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:49:37,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:49:37,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:37" (1/1) ... [2022-11-25 17:49:37,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:37" (1/1) ... [2022-11-25 17:49:37,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:37" (1/1) ... [2022-11-25 17:49:37,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:37" (1/1) ... [2022-11-25 17:49:37,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:37" (1/1) ... [2022-11-25 17:49:37,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:37" (1/1) ... [2022-11-25 17:49:37,650 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:37" (1/1) ... [2022-11-25 17:49:37,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:37" (1/1) ... [2022-11-25 17:49:37,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:49:37,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:49:37,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:49:37,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:49:37,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:37" (1/1) ... [2022-11-25 17:49:37,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:49:37,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:37,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:37,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:49:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:49:37,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 17:49:37,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 17:49:37,778 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 17:49:37,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:49:37,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:49:37,915 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:49:37,918 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:49:40,450 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:49:40,458 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:49:40,458 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 17:49:40,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:49:40 BoogieIcfgContainer [2022-11-25 17:49:40,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:49:40,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:49:40,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:49:40,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:49:40,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:49:37" (1/3) ... [2022-11-25 17:49:40,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3939e015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:49:40, skipping insertion in model container [2022-11-25 17:49:40,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:49:37" (2/3) ... [2022-11-25 17:49:40,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3939e015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:49:40, skipping insertion in model container [2022-11-25 17:49:40,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:49:40" (3/3) ... [2022-11-25 17:49:40,472 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_reinit.c [2022-11-25 17:49:40,496 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:49:40,497 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:49:40,553 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:49:40,562 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;@6c4ff6c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:49:40,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:49:40,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:49:40,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 17:49:40,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:49:40,576 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:49:40,576 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:49:40,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:40,582 INFO L85 PathProgramCache]: Analyzing trace with hash 526466326, now seen corresponding path program 1 times [2022-11-25 17:49:40,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:49:40,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730282366] [2022-11-25 17:49:40,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:40,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:49:40,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:49:40,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:49:40,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 17:49:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:49:42,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:49:42,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:49:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 17:49:42,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:49:42,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:49:42,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730282366] [2022-11-25 17:49:42,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730282366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:49:42,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:49:42,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:49:42,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122828943] [2022-11-25 17:49:42,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:49:42,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:49:42,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:49:42,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:49:42,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:49:42,483 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:49:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:49:42,503 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-11-25 17:49:42,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:49:42,506 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-11-25 17:49:42,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:49:42,515 INFO L225 Difference]: With dead ends: 41 [2022-11-25 17:49:42,516 INFO L226 Difference]: Without dead ends: 18 [2022-11-25 17:49:42,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:49:42,524 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:49:42,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:49:42,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-25 17:49:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-25 17:49:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:49:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-25 17:49:42,581 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 23 [2022-11-25 17:49:42,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:49:42,582 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-25 17:49:42,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 17:49:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-25 17:49:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 17:49:42,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:49:42,588 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:49:42,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:49:42,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:49:42,803 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:49:42,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:42,804 INFO L85 PathProgramCache]: Analyzing trace with hash -398587304, now seen corresponding path program 1 times [2022-11-25 17:49:42,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:49:42,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851154745] [2022-11-25 17:49:42,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:42,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:49:42,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:49:42,810 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:49:42,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 17:49:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:49:59,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 17:49:59,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:50:35,300 WARN L837 $PredicateComparison]: unable to prove that (or (and (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2022-11-25 17:51:07,386 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from false [2022-11-25 17:51:09,441 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from true [2022-11-25 17:51:09,442 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 17:51:09,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:51:09,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:51:09,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851154745] [2022-11-25 17:51:09,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851154745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:51:09,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:51:09,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:51:09,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316537022] [2022-11-25 17:51:09,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:51:09,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:51:09,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:51:09,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:51:09,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=27, Unknown=3, NotChecked=22, Total=72 [2022-11-25 17:51:09,448 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:51:12,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 17:51:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:51:13,004 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-11-25 17:51:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:51:13,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-11-25 17:51:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:51:13,007 INFO L225 Difference]: With dead ends: 30 [2022-11-25 17:51:13,007 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 17:51:13,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=25, Invalid=36, Unknown=3, NotChecked=26, Total=90 [2022-11-25 17:51:13,010 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:51:13,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 1 Unknown, 34 Unchecked, 3.4s Time] [2022-11-25 17:51:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 17:51:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-11-25 17:51:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:51:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-25 17:51:13,020 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-11-25 17:51:13,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:51:13,021 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-25 17:51:13,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:51:13,022 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-25 17:51:13,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 17:51:13,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:51:13,023 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:51:13,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-25 17:51:13,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:51:13,247 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:51:13,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:51:13,248 INFO L85 PathProgramCache]: Analyzing trace with hash -398527722, now seen corresponding path program 1 times [2022-11-25 17:51:13,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:51:13,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275700149] [2022-11-25 17:51:13,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:51:13,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:51:13,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:51:13,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:51:13,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 17:51:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:51:24,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 17:51:24,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:54:12,120 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 4.0))) (let ((.cse3 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse7 (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse8 (fp.mul roundNearestTiesToEven .cse9 .cse4)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse5)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse6)) .cse7) .cse8))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0) (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse5)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse6)) .cse7) .cse8) .cse3)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse5)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse6)) .cse7) .cse8) .cse2)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2022-11-25 17:54:44,134 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse3 (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 .cse0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) (fp.neg .cse5))) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6))) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) .cse5)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6)))))))) is different from false [2022-11-25 17:54:46,203 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse3 (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 .cse0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) (fp.neg .cse5))) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6))) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) .cse5)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6)))))))) is different from true [2022-11-25 17:54:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:54:46,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:54:46,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:54:46,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275700149] [2022-11-25 17:54:46,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275700149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:46,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:46,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 17:54:46,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881972677] [2022-11-25 17:54:46,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:46,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 17:54:46,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:54:46,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 17:54:46,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=60, Unknown=3, NotChecked=34, Total=132 [2022-11-25 17:54:46,209 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:54:49,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 17:54:51,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 17:54:52,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:52,002 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-11-25 17:54:52,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:54:52,003 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2022-11-25 17:54:52,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:52,004 INFO L225 Difference]: With dead ends: 31 [2022-11-25 17:54:52,005 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 17:54:52,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=40, Invalid=75, Unknown=3, NotChecked=38, Total=156 [2022-11-25 17:54:52,007 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:52,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 2 Unknown, 37 Unchecked, 5.7s Time] [2022-11-25 17:54:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 17:54:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-25 17:54:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:54:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-25 17:54:52,015 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-11-25 17:54:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:52,016 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-25 17:54:52,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:54:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-25 17:54:52,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 17:54:52,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:54:52,018 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:52,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:54:52,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:54:52,233 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:54:52,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash 497959587, now seen corresponding path program 1 times [2022-11-25 17:54:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:54:52,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555434177] [2022-11-25 17:54:52,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:52,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:54:52,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:54:52,238 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:54:52,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 17:55:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:10,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 17:55:10,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:04,246 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.neg .cse6)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0)))) (or (and (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse6)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)))) (and (fp.leq .cse7 .cse6) (fp.geq .cse7 .cse5) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))))))) is different from false [2022-11-25 17:56:36,115 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from false [2022-11-25 17:56:38,172 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from true [2022-11-25 17:56:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 1 not checked. [2022-11-25 17:56:38,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:56:50,133 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-11-25 17:56:52,341 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2022-11-25 17:57:03,553 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2022-11-25 17:57:05,705 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2022-11-25 17:57:34,689 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 4.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) .cse4) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))) (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) (fp.neg .cse4)) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))))) is different from false [2022-11-25 17:57:36,949 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 4.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) .cse4) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))) (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) (fp.neg .cse4)) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))))) is different from true [2022-11-25 17:57:36,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:57:36,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555434177] [2022-11-25 17:57:36,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555434177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:57:36,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [971744799] [2022-11-25 17:57:36,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:57:36,952 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 17:57:36,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 17:57:36,957 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 17:57:36,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-25 17:57:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:57:50,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 17:57:50,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:58:34,899 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0))) (.cse1 (fp.neg .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse5)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse6)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse4)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse5)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse6)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse4)) .cse2)))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse5)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse6)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse4)) .cse1)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-25 17:58:54,341 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-25 18:01:26,999 WARN L837 $PredicateComparison]: unable to prove that (or (and (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2022-11-25 18:01:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 6 not checked. [2022-11-25 18:01:55,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:02:42,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [971744799] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:02:42,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:02:42,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 11 [2022-11-25 18:02:42,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340326495] [2022-11-25 18:02:42,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:02:42,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:02:42,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:02:42,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:02:42,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=50, Unknown=16, NotChecked=168, Total=272 [2022-11-25 18:02:42,042 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:02:45,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 18:02:48,164 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 4.0))) (let ((.cse4 (fp.neg .cse3)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse18 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))) (let ((.cse0 (and (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse5) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse8)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse9)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse6)) .cse4)))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse8)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse9)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse6)) .cse3)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse5) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) .cse18)) (.cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))) (and (or .cse0 (and .cse1 (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse8)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse9)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse6)))) (and (fp.leq .cse2 .cse3) (fp.geq .cse2 .cse4) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse5) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))))) (or .cse0 .cse1) (let ((.cse12 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (let ((.cse15 ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0))) (.cse16 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (.cse17 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0))) (.cse14 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0))) (.cse11 (fp.neg .cse12)) (.cse13 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (and .cse1 (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse10 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse14 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse15)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse16)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse17)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse14)))) (and (fp.geq .cse10 .cse11) (fp.leq .cse10 .cse12) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse13) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) (and .cse18 (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse13) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse14 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse15)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse16)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse17)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse14)) .cse12)))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse14 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse15)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse16)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse17)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse14)) .cse11)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse13) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))))))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2022-11-25 18:02:48,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:02:48,190 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-11-25 18:02:48,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:02:48,191 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-11-25 18:02:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:02:48,193 INFO L225 Difference]: With dead ends: 38 [2022-11-25 18:02:48,194 INFO L226 Difference]: Without dead ends: 36 [2022-11-25 18:02:48,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 45.5s TimeCoverageRelationStatistics Valid=46, Invalid=63, Unknown=17, NotChecked=216, Total=342 [2022-11-25 18:02:48,196 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:02:48,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 50 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 1 Unknown, 117 Unchecked, 3.4s Time] [2022-11-25 18:02:48,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-25 18:02:48,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2022-11-25 18:02:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 18:02:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-25 18:02:48,204 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 34 [2022-11-25 18:02:48,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:02:48,205 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-25 18:02:48,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:02:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-25 18:02:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 18:02:48,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:02:48,207 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:02:48,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:02:48,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-11-25 18:02:48,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:02:48,608 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:02:48,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:02:48,608 INFO L85 PathProgramCache]: Analyzing trace with hash 498019169, now seen corresponding path program 1 times [2022-11-25 18:02:48,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:02:48,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379134831] [2022-11-25 18:02:48,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:02:48,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:02:48,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:02:48,610 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:02:48,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1760b388-ccb2-42fd-9764-c2bc1969cab9/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process