./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_reinit.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-2329fc7 [2022-12-13 19:25:54,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:25:54,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:25:54,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:25:54,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:25:54,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:25:54,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:25:54,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:25:54,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:25:54,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:25:54,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:25:54,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:25:54,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:25:54,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:25:54,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:25:54,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:25:54,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:25:54,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:25:54,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:25:54,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:25:54,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:25:54,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:25:54,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:25:54,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:25:54,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:25:54,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:25:54,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:25:54,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:25:54,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:25:54,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:25:54,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:25:54,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:25:54,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:25:54,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:25:54,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:25:54,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:25:54,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:25:54,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:25:54,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:25:54,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:25:54,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:25:54,579 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 19:25:54,599 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:25:54,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:25:54,600 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:25:54,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:25:54,601 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:25:54,601 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:25:54,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:25:54,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:25:54,602 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:25:54,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:25:54,602 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:25:54,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:25:54,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:25:54,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:25:54,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:25:54,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:25:54,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:25:54,604 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:25:54,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:25:54,604 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:25:54,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:25:54,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:25:54,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:25:54,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:25:54,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:25:54,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:25:54,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:25:54,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:25:54,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:25:54,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:25:54,606 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:25:54,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:25:54,606 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:25:54,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:25:54,607 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:25:54,607 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_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 [2022-12-13 19:25:54,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:25:54,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:25:54,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:25:54,810 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:25:54,810 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:25:54,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-12-13 19:25:57,534 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:25:57,671 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:25:57,672 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-12-13 19:25:57,676 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/data/91037ff48/4a1e481506c94ce89c1208d6390be22f/FLAGbcd5667b0 [2022-12-13 19:25:57,690 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/data/91037ff48/4a1e481506c94ce89c1208d6390be22f [2022-12-13 19:25:57,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:25:57,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:25:57,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:25:57,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:25:57,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:25:57,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:25:57" (1/1) ... [2022-12-13 19:25:57,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2735d2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:25:57, skipping insertion in model container [2022-12-13 19:25:57,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:25:57" (1/1) ... [2022-12-13 19:25:57,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:25:57,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:25:57,842 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_e984b0bf-15a7-468d-9702-1d2d35b00f8d/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-12-13 19:25:57,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:25:57,863 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:25:57,873 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_e984b0bf-15a7-468d-9702-1d2d35b00f8d/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-12-13 19:25:57,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:25:57,890 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:25:57,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:25:57 WrapperNode [2022-12-13 19:25:57,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:25:57,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:25:57,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:25:57,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:25:57,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:25:57" (1/1) ... [2022-12-13 19:25:57,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:25:57" (1/1) ... [2022-12-13 19:25:57,914 INFO L138 Inliner]: procedures = 15, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-12-13 19:25:57,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:25:57,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:25:57,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:25:57,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:25:57,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:25:57" (1/1) ... [2022-12-13 19:25:57,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:25:57" (1/1) ... [2022-12-13 19:25:57,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:25:57" (1/1) ... [2022-12-13 19:25:57,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:25:57" (1/1) ... [2022-12-13 19:25:57,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:25:57" (1/1) ... [2022-12-13 19:25:57,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:25:57" (1/1) ... [2022-12-13 19:25:57,930 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:25:57" (1/1) ... [2022-12-13 19:25:57,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:25:57" (1/1) ... [2022-12-13 19:25:57,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:25:57,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:25:57,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:25:57,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:25:57,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:25:57" (1/1) ... [2022-12-13 19:25:57,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:25:57,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:25:57,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:25:57,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:25:57,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:25:57,996 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 19:25:57,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 19:25:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:25:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:25:57,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:25:58,058 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:25:58,060 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:25:58,140 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:25:58,145 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:25:58,145 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 19:25:58,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:25:58 BoogieIcfgContainer [2022-12-13 19:25:58,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:25:58,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:25:58,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:25:58,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:25:58,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:25:57" (1/3) ... [2022-12-13 19:25:58,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1f51b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:25:58, skipping insertion in model container [2022-12-13 19:25:58,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:25:57" (2/3) ... [2022-12-13 19:25:58,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1f51b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:25:58, skipping insertion in model container [2022-12-13 19:25:58,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:25:58" (3/3) ... [2022-12-13 19:25:58,154 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_reinit.c [2022-12-13 19:25:58,171 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:25:58,171 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 19:25:58,218 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:25:58,225 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;@67c6f06b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:25:58,225 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 19:25:58,229 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-12-13 19:25:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 19:25:58,236 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:25:58,237 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:25:58,238 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:25:58,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:25:58,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1343975806, now seen corresponding path program 1 times [2022-12-13 19:25:58,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:25:58,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091904774] [2022-12-13 19:25:58,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:25:58,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:25:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:25:58,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:25:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:25:58,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:25:58,382 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 19:25:58,384 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 19:25:58,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:25:58,390 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-12-13 19:25:58,393 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 19:25:58,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:25:58 BoogieIcfgContainer [2022-12-13 19:25:58,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 19:25:58,411 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 19:25:58,411 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 19:25:58,411 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 19:25:58,411 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:25:58" (3/4) ... [2022-12-13 19:25:58,414 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 19:25:58,414 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 19:25:58,414 INFO L158 Benchmark]: Toolchain (without parser) took 720.80ms. Allocated memory is still 130.0MB. Free memory was 96.4MB in the beginning and 57.1MB in the end (delta: 39.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-12-13 19:25:58,415 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:25:58,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.54ms. Allocated memory is still 130.0MB. Free memory was 96.4MB in the beginning and 86.0MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 19:25:58,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.47ms. Allocated memory is still 130.0MB. Free memory was 86.0MB in the beginning and 84.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:25:58,417 INFO L158 Benchmark]: Boogie Preprocessor took 18.23ms. Allocated memory is still 130.0MB. Free memory was 84.4MB in the beginning and 83.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:25:58,417 INFO L158 Benchmark]: RCFGBuilder took 212.65ms. Allocated memory is still 130.0MB. Free memory was 83.0MB in the beginning and 73.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 19:25:58,418 INFO L158 Benchmark]: TraceAbstraction took 262.13ms. Allocated memory is still 130.0MB. Free memory was 72.5MB in the beginning and 57.6MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 19:25:58,418 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 130.0MB. Free memory is still 57.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:25:58,421 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.15ms. Allocated memory is still 130.0MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.54ms. Allocated memory is still 130.0MB. Free memory was 96.4MB in the beginning and 86.0MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.47ms. Allocated memory is still 130.0MB. Free memory was 86.0MB in the beginning and 84.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.23ms. Allocated memory is still 130.0MB. Free memory was 84.4MB in the beginning and 83.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 212.65ms. Allocated memory is still 130.0MB. Free memory was 83.0MB in the beginning and 73.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 262.13ms. Allocated memory is still 130.0MB. Free memory was 72.5MB in the beginning and 57.6MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 130.0MB. Free memory is still 57.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of to_real at line 31, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L23] double E, E0, E1, S0, S1, S; [L24] int i; [L26] E = __VERIFIER_nondet_double() [L27] E0 = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L16] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(E >= 0. && E <= 1.) [L29] CALL assume_abort_if_not(E0 >= 0. && E0 <= 1.) VAL [\old(cond)=1] [L16] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L29] RET assume_abort_if_not(E0 >= 0. && E0 <= 1.) [L31] S0 = 0 [L32] S = 0 [L34] i = 0 VAL [i=0] [L34] COND TRUE i <= 1000000 [L36] E1 = E0 [L37] E0 = E [L39] E = __VERIFIER_nondet_double() [L40] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L16] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L40] RET assume_abort_if_not(E >= 0. && E <= 1.) VAL [E=55, E=54, E=53, i=0] [L42] COND TRUE __VERIFIER_nondet_int() [L43] E1 = E [L44] E0 = E [L45] S0 = E [L46] S = E VAL [E=54, E=54, E=54, i=0, S=54, S0=54] [L49] S1 = S0 [L50] S0 = S [L51] S = 0.7*E - E0*1.3 + E1*1.1 + S0*1.4 - S1*0.7 [L53] CALL __VERIFIER_assert(S >= -4. && S <= 4.) [L18] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L18] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, 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.0s 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-12-13 19:25:58,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_reinit.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-2329fc7 [2022-12-13 19:26:00,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:26:00,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:26:00,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:26:00,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:26:00,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:26:00,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:26:00,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:26:00,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:26:00,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:26:00,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:26:00,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:26:00,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:26:00,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:26:00,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:26:00,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:26:00,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:26:00,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:26:00,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:26:00,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:26:00,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:26:00,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:26:00,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:26:00,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:26:00,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:26:00,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:26:00,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:26:00,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:26:00,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:26:00,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:26:00,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:26:00,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:26:00,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:26:00,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:26:00,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:26:00,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:26:00,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:26:00,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:26:00,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:26:00,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:26:00,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:26:00,088 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-12-13 19:26:00,110 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:26:00,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:26:00,110 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:26:00,110 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:26:00,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:26:00,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:26:00,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:26:00,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:26:00,112 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:26:00,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:26:00,113 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:26:00,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:26:00,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:26:00,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:26:00,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:26:00,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:26:00,114 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 19:26:00,114 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 19:26:00,114 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 19:26:00,115 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:26:00,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:26:00,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:26:00,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:26:00,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:26:00,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:26:00,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:26:00,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:26:00,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:26:00,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:26:00,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:26:00,117 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 19:26:00,117 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 19:26:00,117 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:26:00,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:26:00,117 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:26:00,118 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:26:00,118 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 19:26:00,118 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:26:00,118 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_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 [2022-12-13 19:26:00,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:26:00,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:26:00,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:26:00,371 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:26:00,371 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:26:00,372 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-12-13 19:26:02,969 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:26:03,121 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:26:03,121 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-12-13 19:26:03,126 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/data/2c03f7fa1/5bee22e46bdf42698e6e975504bdf504/FLAG34d34c8d1 [2022-12-13 19:26:03,137 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/data/2c03f7fa1/5bee22e46bdf42698e6e975504bdf504 [2022-12-13 19:26:03,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:26:03,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:26:03,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:26:03,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:26:03,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:26:03,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:26:03" (1/1) ... [2022-12-13 19:26:03,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552599b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:26:03, skipping insertion in model container [2022-12-13 19:26:03,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:26:03" (1/1) ... [2022-12-13 19:26:03,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:26:03,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:26:03,297 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_e984b0bf-15a7-468d-9702-1d2d35b00f8d/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-12-13 19:26:03,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:26:03,326 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:26:03,338 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_e984b0bf-15a7-468d-9702-1d2d35b00f8d/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-12-13 19:26:03,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:26:03,359 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:26:03,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:26:03 WrapperNode [2022-12-13 19:26:03,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:26:03,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:26:03,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:26:03,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:26:03,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:26:03" (1/1) ... [2022-12-13 19:26:03,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:26:03" (1/1) ... [2022-12-13 19:26:03,397 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-12-13 19:26:03,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:26:03,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:26:03,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:26:03,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:26:03,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:26:03" (1/1) ... [2022-12-13 19:26:03,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:26:03" (1/1) ... [2022-12-13 19:26:03,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:26:03" (1/1) ... [2022-12-13 19:26:03,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:26:03" (1/1) ... [2022-12-13 19:26:03,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:26:03" (1/1) ... [2022-12-13 19:26:03,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:26:03" (1/1) ... [2022-12-13 19:26:03,422 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:26:03" (1/1) ... [2022-12-13 19:26:03,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:26:03" (1/1) ... [2022-12-13 19:26:03,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:26:03,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:26:03,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:26:03,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:26:03,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:26:03" (1/1) ... [2022-12-13 19:26:03,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:26:03,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:26:03,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:26:03,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:26:03,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:26:03,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 19:26:03,493 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 19:26:03,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 19:26:03,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:26:03,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:26:03,560 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:26:03,562 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:26:05,873 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:26:05,880 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:26:05,881 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 19:26:05,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:26:05 BoogieIcfgContainer [2022-12-13 19:26:05,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:26:05,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:26:05,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:26:05,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:26:05,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:26:03" (1/3) ... [2022-12-13 19:26:05,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b63ccaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:26:05, skipping insertion in model container [2022-12-13 19:26:05,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:26:03" (2/3) ... [2022-12-13 19:26:05,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b63ccaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:26:05, skipping insertion in model container [2022-12-13 19:26:05,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:26:05" (3/3) ... [2022-12-13 19:26:05,892 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_reinit.c [2022-12-13 19:26:05,907 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:26:05,908 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 19:26:05,945 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:26:05,951 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;@72f2d008, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:26:05,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 19:26:05,955 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-12-13 19:26:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 19:26:05,961 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:26:05,961 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:26:05,962 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:26:05,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:26:05,966 INFO L85 PathProgramCache]: Analyzing trace with hash 526466326, now seen corresponding path program 1 times [2022-12-13 19:26:05,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:26:05,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686174686] [2022-12-13 19:26:05,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:26:05,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:26:05,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:26:05,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:26:05,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 19:26:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:26:07,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 19:26:07,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:26:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 19:26:07,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:26:07,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:26:07,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686174686] [2022-12-13 19:26:07,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686174686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:26:07,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:26:07,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:26:07,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994108349] [2022-12-13 19:26:07,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:26:07,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 19:26:07,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:26:07,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 19:26:07,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 19:26:07,301 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-12-13 19:26:07,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:26:07,316 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-12-13 19:26:07,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 19:26:07,318 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-12-13 19:26:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:26:07,323 INFO L225 Difference]: With dead ends: 41 [2022-12-13 19:26:07,323 INFO L226 Difference]: Without dead ends: 18 [2022-12-13 19:26:07,325 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-12-13 19:26:07,328 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-12-13 19:26:07,329 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-12-13 19:26:07,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-13 19:26:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-13 19:26:07,352 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-12-13 19:26:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-12-13 19:26:07,355 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 23 [2022-12-13 19:26:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:26:07,355 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-12-13 19:26:07,355 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-12-13 19:26:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-12-13 19:26:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 19:26:07,362 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:26:07,362 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:26:07,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:26:07,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:26:07,564 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:26:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:26:07,566 INFO L85 PathProgramCache]: Analyzing trace with hash -398587304, now seen corresponding path program 1 times [2022-12-13 19:26:07,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:26:07,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328211234] [2022-12-13 19:26:07,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:26:07,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:26:07,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:26:07,572 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:26:07,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 19:26:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:26:19,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 19:26:19,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:26:54,444 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-12-13 19:27:23,978 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-12-13 19:27:26,023 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-12-13 19:27:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 19:27:26,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:27:26,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:27:26,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328211234] [2022-12-13 19:27:26,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328211234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:27:26,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:27:26,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 19:27:26,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741306729] [2022-12-13 19:27:26,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:27:26,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 19:27:26,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:27:26,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 19:27:26,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=27, Unknown=3, NotChecked=22, Total=72 [2022-12-13 19:27:26,028 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-12-13 19:27:29,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 19:27:29,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:27:29,223 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-12-13 19:27:29,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 19:27:29,224 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-12-13 19:27:29,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:27:29,225 INFO L225 Difference]: With dead ends: 30 [2022-12-13 19:27:29,225 INFO L226 Difference]: Without dead ends: 28 [2022-12-13 19:27:29,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=25, Invalid=36, Unknown=3, NotChecked=26, Total=90 [2022-12-13 19:27:29,226 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:27:29,227 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.1s Time] [2022-12-13 19:27:29,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-13 19:27:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-12-13 19:27:29,232 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-12-13 19:27:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-12-13 19:27:29,233 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-12-13 19:27:29,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:27:29,233 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-12-13 19:27:29,233 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-12-13 19:27:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-12-13 19:27:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 19:27:29,234 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:27:29,234 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:27:29,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 19:27:29,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:27:29,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:27:29,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:27:29,435 INFO L85 PathProgramCache]: Analyzing trace with hash -398527722, now seen corresponding path program 1 times [2022-12-13 19:27:29,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:27:29,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071064013] [2022-12-13 19:27:29,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:27:29,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:27:29,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:27:29,437 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:27:29,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 19:27:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:27:37,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 19:27:37,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:30:22,881 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 4.0))) (let ((.cse3 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse7 (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse8 (fp.mul roundNearestTiesToEven .cse9 .cse4)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse5)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse6)) .cse7) .cse8))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0) (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse5)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse6)) .cse7) .cse8) .cse3)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse5)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse6)) .cse7) .cse8) .cse2)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2022-12-13 19:30:54,487 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse3 (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 .cse0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) (fp.neg .cse5))) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6))) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) .cse5)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6)))))))) is different from false [2022-12-13 19:30:56,535 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse3 (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 .cse0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) (fp.neg .cse5))) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6))) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) .cse5)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6)))))))) is different from true [2022-12-13 19:30:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:30:56,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:30:56,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:30:56,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071064013] [2022-12-13 19:30:56,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071064013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:30:56,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:30:56,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 19:30:56,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011689928] [2022-12-13 19:30:56,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:30:56,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 19:30:56,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:30:56,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 19:30:56,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=60, Unknown=3, NotChecked=34, Total=132 [2022-12-13 19:30:56,538 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-12-13 19:30:59,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 19:31:01,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 19:31:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:31:02,213 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-12-13 19:31:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 19:31:02,215 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-12-13 19:31:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:31:02,216 INFO L225 Difference]: With dead ends: 31 [2022-12-13 19:31:02,216 INFO L226 Difference]: Without dead ends: 29 [2022-12-13 19:31:02,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=40, Invalid=75, Unknown=3, NotChecked=38, Total=156 [2022-12-13 19:31:02,218 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s 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.5s IncrementalHoareTripleChecker+Time [2022-12-13 19:31:02,219 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.5s Time] [2022-12-13 19:31:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-13 19:31:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-12-13 19:31:02,225 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-12-13 19:31:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-12-13 19:31:02,226 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-12-13 19:31:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:31:02,226 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-12-13 19:31:02,227 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-12-13 19:31:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-12-13 19:31:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 19:31:02,228 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:31:02,228 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-12-13 19:31:02,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 19:31:02,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:31:02,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:31:02,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:31:02,432 INFO L85 PathProgramCache]: Analyzing trace with hash 497959587, now seen corresponding path program 1 times [2022-12-13 19:31:02,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 19:31:02,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607984498] [2022-12-13 19:31:02,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:31:02,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 19:31:02,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 19:31:02,436 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 19:31:02,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 19:31:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:31:15,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 19:31:15,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:31:48,106 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-12-13 19:32:19,861 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-12-13 19:32:21,914 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-12-13 19:32:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 1 not checked. [2022-12-13 19:32:21,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:32:33,665 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-12-13 19:32:35,860 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-12-13 19:32:46,965 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-12-13 19:32:49,098 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-12-13 19:33:16,963 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-12-13 19:33:19,218 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-12-13 19:33:19,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 19:33:19,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607984498] [2022-12-13 19:33:19,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607984498] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:33:19,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [506071631] [2022-12-13 19:33:19,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:33:19,221 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 19:33:19,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 19:33:19,222 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 19:33:19,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984b0bf-15a7-468d-9702-1d2d35b00f8d/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-12-13 19:33:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:33:30,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 19:33:30,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:34:16,603 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-12-13 19:35:01,924 WARN L233 SmtUtils]: Spent 9.03s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:36:45,158 WARN L233 SmtUtils]: Spent 10.39s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:37:30,815 WARN L233 SmtUtils]: Spent 11.80s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:38:41,646 WARN L233 SmtUtils]: Spent 18.05s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 19:39:01,515 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~E~0#1| |c_ULTIMATE.start_main_~S0~0#1|) (= |c_ULTIMATE.start_main_~E~0#1| |c_ULTIMATE.start_main_~E1~0#1|) (fp.leq |c_ULTIMATE.start_main_~E~0#1| .cse0) (= |c_ULTIMATE.start_main_~S~0#1| |c_ULTIMATE.start_main_~E~0#1|) (= |c_ULTIMATE.start_main_~E~0#1| |c_ULTIMATE.start_main_~E0~0#1|) (fp.geq |c_ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |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| .cse3)))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse1 (fp.neg .cse2)) (fp.leq .cse1 .cse2) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 19:40:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2022-12-13 19:40:02,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:40:49,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [506071631] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:40:49,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:40:49,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 13 [2022-12-13 19:40:49,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005159906] [2022-12-13 19:40:49,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:40:49,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 19:40:49,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 19:40:49,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 19:40:49,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=70, Unknown=40, NotChecked=182, Total=342 [2022-12-13 19:40:49,071 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 19:40:51,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:40:56,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:40:58,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:41:00,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:41:02,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:41:04,948 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_assume_abort_if_not_#in~cond| c_assume_abort_if_not_~cond) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from false [2022-12-13 19:41:07,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:41:09,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:41:11,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:41:14,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:41:16,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:41:18,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]