./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --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 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:14:27,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:14:28,064 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 23:14:28,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:14:28,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:14:28,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:14:28,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:14:28,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:14:28,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:14:28,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:14:28,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:14:28,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:14:28,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:14:28,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:14:28,110 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:14:28,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:14:28,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:14:28,110 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:14:28,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:14:28,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:14:28,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:14:28,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:14:28,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:14:28,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:14:28,111 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:14:28,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:14:28,111 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:14:28,111 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:14:28,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:14:28,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:14:28,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:14:28,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:14:28,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:14:28,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:14:28,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:14:28,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:14:28,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:14:28,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:14:28,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:14:28,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:14:28,113 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:14:28,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:14:28,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:14:28,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:14:28,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:14:28,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:14:28,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:14:28,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:14:28,113 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2024-11-27 23:14:28,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:14:28,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:14:28,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:14:28,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:14:28,384 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:14:28,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2024-11-27 23:14:31,301 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/data/9374c630b/031b85e9cf194aa0b3b58087eee59558/FLAG1461244a5 [2024-11-27 23:14:31,674 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:14:31,675 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2024-11-27 23:14:31,684 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/data/9374c630b/031b85e9cf194aa0b3b58087eee59558/FLAG1461244a5 [2024-11-27 23:14:31,698 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/data/9374c630b/031b85e9cf194aa0b3b58087eee59558 [2024-11-27 23:14:31,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:14:31,703 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:14:31,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:14:31,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:14:31,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:14:31,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:14:31" (1/1) ... [2024-11-27 23:14:31,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e8f2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31, skipping insertion in model container [2024-11-27 23:14:31,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:14:31" (1/1) ... [2024-11-27 23:14:31,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:14:31,872 WARN L250 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_f0ea8044-3f38-4373-bc5b-00e812dd8eff/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2024-11-27 23:14:31,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:14:31,887 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:14:31,901 WARN L250 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_f0ea8044-3f38-4373-bc5b-00e812dd8eff/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2024-11-27 23:14:31,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:14:31,920 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:14:31,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31 WrapperNode [2024-11-27 23:14:31,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:14:31,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:14:31,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:14:31,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:14:31,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31" (1/1) ... [2024-11-27 23:14:31,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31" (1/1) ... [2024-11-27 23:14:31,947 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2024-11-27 23:14:31,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:14:31,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:14:31,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:14:31,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:14:31,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31" (1/1) ... [2024-11-27 23:14:31,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31" (1/1) ... [2024-11-27 23:14:31,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31" (1/1) ... [2024-11-27 23:14:31,964 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 23:14:31,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31" (1/1) ... [2024-11-27 23:14:31,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31" (1/1) ... [2024-11-27 23:14:31,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31" (1/1) ... [2024-11-27 23:14:31,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31" (1/1) ... [2024-11-27 23:14:31,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31" (1/1) ... [2024-11-27 23:14:31,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31" (1/1) ... [2024-11-27 23:14:31,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31" (1/1) ... [2024-11-27 23:14:31,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:14:31,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:14:31,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:14:31,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:14:31,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31" (1/1) ... [2024-11-27 23:14:31,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:14:31,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:14:32,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:14:32,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:14:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:14:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:14:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:14:32,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:14:32,109 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:14:32,111 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:14:32,273 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-27 23:14:32,273 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:14:32,284 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:14:32,284 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 23:14:32,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:14:32 BoogieIcfgContainer [2024-11-27 23:14:32,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:14:32,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:14:32,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:14:32,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:14:32,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:14:31" (1/3) ... [2024-11-27 23:14:32,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50df0793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:14:32, skipping insertion in model container [2024-11-27 23:14:32,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:31" (2/3) ... [2024-11-27 23:14:32,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50df0793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:14:32, skipping insertion in model container [2024-11-27 23:14:32,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:14:32" (3/3) ... [2024-11-27 23:14:32,297 INFO L128 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2024-11-27 23:14:32,313 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:14:32,315 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG filter1.c.p+cfa-reducer.c that has 1 procedures, 19 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-27 23:14:32,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:14:32,402 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2cabfce8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:14:32,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:14:32,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 23:14:32,413 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:14:32,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:14:32,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:14:32,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:14:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1824272086, now seen corresponding path program 1 times [2024-11-27 23:14:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:14:32,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229573384] [2024-11-27 23:14:32,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:14:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:14:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:14:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:14:32,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:14:32,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229573384] [2024-11-27 23:14:32,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229573384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:14:32,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:14:32,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:14:32,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143167963] [2024-11-27 23:14:32,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:14:32,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:14:32,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:14:32,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:14:32,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:14:32,672 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:14:32,697 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2024-11-27 23:14:32,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:14:32,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-27 23:14:32,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:14:32,705 INFO L225 Difference]: With dead ends: 37 [2024-11-27 23:14:32,706 INFO L226 Difference]: Without dead ends: 15 [2024-11-27 23:14:32,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:14:32,711 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:14:32,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:14:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-27 23:14:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-27 23:14:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-11-27 23:14:32,743 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2024-11-27 23:14:32,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:14:32,743 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-11-27 23:14:32,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-11-27 23:14:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 23:14:32,744 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:14:32,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:14:32,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:14:32,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:14:32,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:14:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2000333105, now seen corresponding path program 1 times [2024-11-27 23:14:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:14:32,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423469809] [2024-11-27 23:14:32,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:14:32,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:14:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:14:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:14:32,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:14:32,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423469809] [2024-11-27 23:14:32,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423469809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:14:32,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:14:32,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:14:32,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106109341] [2024-11-27 23:14:32,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:14:32,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:14:32,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:14:32,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:14:32,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:14:32,851 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:32,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:14:32,889 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-11-27 23:14:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:14:32,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-27 23:14:32,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:14:32,890 INFO L225 Difference]: With dead ends: 19 [2024-11-27 23:14:32,890 INFO L226 Difference]: Without dead ends: 17 [2024-11-27 23:14:32,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:14:32,891 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:14:32,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:14:32,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-27 23:14:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-27 23:14:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-27 23:14:32,899 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2024-11-27 23:14:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:14:32,899 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-27 23:14:32,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-11-27 23:14:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 23:14:32,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:14:32,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:14:32,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:14:32,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:14:32,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:14:32,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1983322444, now seen corresponding path program 1 times [2024-11-27 23:14:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:14:32,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78753260] [2024-11-27 23:14:32,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:14:32,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:14:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:14:32,932 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 23:14:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:14:32,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 23:14:32,966 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 23:14:32,967 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 23:14:32,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 23:14:32,974 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-27 23:14:32,994 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 23:14:32,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:14:32 BoogieIcfgContainer [2024-11-27 23:14:32,999 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 23:14:32,999 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 23:14:32,999 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 23:14:33,000 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 23:14:33,002 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:14:32" (3/4) ... [2024-11-27 23:14:33,005 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 23:14:33,006 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 23:14:33,007 INFO L158 Benchmark]: Toolchain (without parser) took 1303.89ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 41.4MB in the end (delta: 52.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-27 23:14:33,007 INFO L158 Benchmark]: CDTParser took 1.39ms. Allocated memory is still 167.8MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:14:33,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.51ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 82.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:14:33,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.00ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 80.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:14:33,008 INFO L158 Benchmark]: Boogie Preprocessor took 25.83ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:14:33,008 INFO L158 Benchmark]: RCFGBuilder took 309.66ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 69.2MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 23:14:33,008 INFO L158 Benchmark]: TraceAbstraction took 711.16ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 41.4MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 23:14:33,009 INFO L158 Benchmark]: Witness Printer took 6.27ms. Allocated memory is still 117.4MB. Free memory is still 41.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:14:33,011 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39ms. Allocated memory is still 167.8MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.51ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 82.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.00ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 80.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.83ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 309.66ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 69.2MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 711.16ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 41.4MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 6.27ms. Allocated memory is still 117.4MB. Free memory is still 41.4MB. 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: 56]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 27, overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 29, overapproximation of to_real at line 39, overapproximation of to_real at line 19. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L15] double main__E0; [L16] double main__E1; [L17] double main__S; [L18] int main__i; [L19] main__E1 = 0 [L20] main__S = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i <= 1000000 [L25] main__E0 = __VERIFIER_nondet_double() [L26] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__i=0] [L27] COND TRUE main__E0 >= -1.0 VAL [__return_main=0, main__i=0] [L29] COND TRUE main__E0 <= 1.0 [L31] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0] [L33] COND TRUE main____CPAchecker_TMP_0 != 0 [L35] int main____CPAchecker_TMP_1; [L36] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L37] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L39] main__S = 0 VAL [__return_main=0, main__i=0] [L41] main__E1 = main__E0 [L42] int main____CPAchecker_TMP_2; VAL [__return_main=0, main__i=0] [L43] COND FALSE !(main__S >= -10000.0) VAL [__return_main=0, main__i=0] [L69] main____CPAchecker_TMP_2 = 0 VAL [__return_main=0, main____CPAchecker_TMP_2=0, main__i=0] [L50] int __tmp_1; [L51] __tmp_1 = main____CPAchecker_TMP_2 [L52] int __VERIFIER_assert__cond; [L53] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0, main__i=0] [L54] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, main__i=0] [L56] reach_error() VAL [__return_main=0, main__i=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 39 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 34 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 23:14:33,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --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 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:14:35,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:14:35,776 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-27 23:14:35,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:14:35,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:14:35,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:14:35,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:14:35,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:14:35,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:14:35,823 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:14:35,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:14:35,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:14:35,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:14:35,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:14:35,827 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:14:35,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:14:35,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:14:35,828 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:14:35,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:14:35,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:14:35,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:14:35,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:14:35,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:14:35,829 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 23:14:35,829 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 23:14:35,829 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 23:14:35,829 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:14:35,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:14:35,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:14:35,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:14:35,830 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:14:35,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:14:35,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:14:35,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:14:35,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:14:35,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:14:35,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:14:35,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:14:35,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:14:35,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:14:35,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:14:35,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:14:35,832 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:14:35,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:14:35,832 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 23:14:35,832 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 23:14:35,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:14:35,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:14:35,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:14:35,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:14:35,832 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2024-11-27 23:14:36,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:14:36,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:14:36,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:14:36,163 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:14:36,164 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:14:36,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2024-11-27 23:14:39,132 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/data/34f07a01c/1ed1cc9e77fa4819aa4018a3be7a7a30/FLAG542dfbeca [2024-11-27 23:14:39,387 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:14:39,388 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2024-11-27 23:14:39,397 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/data/34f07a01c/1ed1cc9e77fa4819aa4018a3be7a7a30/FLAG542dfbeca [2024-11-27 23:14:39,418 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/data/34f07a01c/1ed1cc9e77fa4819aa4018a3be7a7a30 [2024-11-27 23:14:39,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:14:39,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:14:39,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:14:39,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:14:39,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:14:39,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:14:39" (1/1) ... [2024-11-27 23:14:39,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10cfc38f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39, skipping insertion in model container [2024-11-27 23:14:39,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:14:39" (1/1) ... [2024-11-27 23:14:39,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:14:39,645 WARN L250 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_f0ea8044-3f38-4373-bc5b-00e812dd8eff/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2024-11-27 23:14:39,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:14:39,677 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:14:39,699 WARN L250 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_f0ea8044-3f38-4373-bc5b-00e812dd8eff/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2024-11-27 23:14:39,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:14:39,723 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:14:39,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39 WrapperNode [2024-11-27 23:14:39,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:14:39,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:14:39,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:14:39,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:14:39,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39" (1/1) ... [2024-11-27 23:14:39,746 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39" (1/1) ... [2024-11-27 23:14:39,762 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2024-11-27 23:14:39,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:14:39,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:14:39,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:14:39,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:14:39,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39" (1/1) ... [2024-11-27 23:14:39,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39" (1/1) ... [2024-11-27 23:14:39,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39" (1/1) ... [2024-11-27 23:14:39,787 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 23:14:39,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39" (1/1) ... [2024-11-27 23:14:39,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39" (1/1) ... [2024-11-27 23:14:39,799 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39" (1/1) ... [2024-11-27 23:14:39,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39" (1/1) ... [2024-11-27 23:14:39,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39" (1/1) ... [2024-11-27 23:14:39,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39" (1/1) ... [2024-11-27 23:14:39,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39" (1/1) ... [2024-11-27 23:14:39,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:14:39,812 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:14:39,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:14:39,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:14:39,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39" (1/1) ... [2024-11-27 23:14:39,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:14:39,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:14:39,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:14:39,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:14:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:14:39,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 23:14:39,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:14:39,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:14:39,934 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:14:39,936 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:14:44,158 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-27 23:14:44,158 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:14:44,168 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:14:44,168 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 23:14:44,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:14:44 BoogieIcfgContainer [2024-11-27 23:14:44,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:14:44,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:14:44,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:14:44,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:14:44,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:14:39" (1/3) ... [2024-11-27 23:14:44,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7952dd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:14:44, skipping insertion in model container [2024-11-27 23:14:44,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:39" (2/3) ... [2024-11-27 23:14:44,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7952dd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:14:44, skipping insertion in model container [2024-11-27 23:14:44,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:14:44" (3/3) ... [2024-11-27 23:14:44,179 INFO L128 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2024-11-27 23:14:44,195 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:14:44,197 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG filter1.c.p+cfa-reducer.c that has 1 procedures, 19 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-27 23:14:44,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:14:44,259 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4e95a194, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:14:44,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:14:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 23:14:44,277 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:14:44,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:14:44,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:14:44,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:14:44,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1824272086, now seen corresponding path program 1 times [2024-11-27 23:14:44,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:14:44,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992438634] [2024-11-27 23:14:44,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:14:44,298 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 [2024-11-27 23:14:44,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:14:44,303 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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) [2024-11-27 23:14:44,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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 [2024-11-27 23:14:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:14:44,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 23:14:44,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:14:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:14:44,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:14:44,481 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:14:44,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992438634] [2024-11-27 23:14:44,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992438634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:14:44,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:14:44,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:14:44,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763109173] [2024-11-27 23:14:44,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:14:44,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:14:44,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:14:44,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:14:44,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:14:44,513 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:44,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:14:44,577 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2024-11-27 23:14:44,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:14:44,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-27 23:14:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:14:44,587 INFO L225 Difference]: With dead ends: 37 [2024-11-27 23:14:44,587 INFO L226 Difference]: Without dead ends: 15 [2024-11-27 23:14:44,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:14:44,594 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:14:44,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:14:44,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-27 23:14:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-27 23:14:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-11-27 23:14:44,630 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2024-11-27 23:14:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:14:44,630 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-11-27 23:14:44,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-11-27 23:14:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 23:14:44,632 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:14:44,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:14:44,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-27 23:14:44,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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 [2024-11-27 23:14:44,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:14:44,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:14:44,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2000333105, now seen corresponding path program 1 times [2024-11-27 23:14:44,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:14:44,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084158430] [2024-11-27 23:14:44,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:14:44,836 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 [2024-11-27 23:14:44,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:14:44,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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) [2024-11-27 23:14:44,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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 [2024-11-27 23:14:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:14:44,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 23:14:44,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:14:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:14:44,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:14:44,992 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:14:44,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084158430] [2024-11-27 23:14:44,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084158430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:14:44,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:14:44,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:14:44,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678015335] [2024-11-27 23:14:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:14:44,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:14:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:14:44,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:14:44,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:14:44,999 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:14:45,075 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-11-27 23:14:45,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:14:45,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-27 23:14:45,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:14:45,077 INFO L225 Difference]: With dead ends: 19 [2024-11-27 23:14:45,077 INFO L226 Difference]: Without dead ends: 17 [2024-11-27 23:14:45,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:14:45,079 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:14:45,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:14:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-27 23:14:45,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-27 23:14:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-27 23:14:45,083 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2024-11-27 23:14:45,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:14:45,084 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-27 23:14:45,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-11-27 23:14:45,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 23:14:45,085 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:14:45,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:14:45,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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 [2024-11-27 23:14:45,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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 [2024-11-27 23:14:45,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:14:45,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:14:45,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1983322444, now seen corresponding path program 1 times [2024-11-27 23:14:45,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:14:45,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696993227] [2024-11-27 23:14:45,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:14:45,287 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 [2024-11-27 23:14:45,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:14:45,291 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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) [2024-11-27 23:14:45,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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 [2024-11-27 23:14:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:14:45,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 23:14:45,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:14:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:14:45,392 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:14:45,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:14:45,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696993227] [2024-11-27 23:14:45,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696993227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:14:45,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:14:45,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:14:45,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010680607] [2024-11-27 23:14:45,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:14:45,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:14:45,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:14:45,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:14:45,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:14:45,394 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:46,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 23:14:46,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:14:46,677 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-27 23:14:46,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:14:46,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-27 23:14:46,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:14:46,679 INFO L225 Difference]: With dead ends: 42 [2024-11-27 23:14:46,679 INFO L226 Difference]: Without dead ends: 27 [2024-11-27 23:14:46,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:14:46,680 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:14:46,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 20 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-27 23:14:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-27 23:14:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2024-11-27 23:14:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-27 23:14:46,686 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2024-11-27 23:14:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:14:46,687 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-27 23:14:46,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-27 23:14:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 23:14:46,688 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:14:46,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:14:46,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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 [2024-11-27 23:14:46,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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 [2024-11-27 23:14:46,889 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:14:46,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:14:46,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1270566899, now seen corresponding path program 1 times [2024-11-27 23:14:46,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:14:46,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942139318] [2024-11-27 23:14:46,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:14:46,890 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 [2024-11-27 23:14:46,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:14:46,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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) [2024-11-27 23:14:46,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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 [2024-11-27 23:14:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:14:47,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-27 23:14:47,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:14:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:14:48,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:14:48,135 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:14:48,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942139318] [2024-11-27 23:14:48,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942139318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:14:48,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:14:48,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:14:48,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416865210] [2024-11-27 23:14:48,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:14:48,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:14:48,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:14:48,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:14:48,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:14:48,137 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:54,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:14:58,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:14:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:14:58,971 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2024-11-27 23:14:59,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 23:14:59,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-27 23:14:59,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:14:59,002 INFO L225 Difference]: With dead ends: 54 [2024-11-27 23:14:59,002 INFO L226 Difference]: Without dead ends: 36 [2024-11-27 23:14:59,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:14:59,003 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-27 23:14:59,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 26 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 2 Unknown, 0 Unchecked, 10.8s Time] [2024-11-27 23:14:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-27 23:14:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2024-11-27 23:14:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-27 23:14:59,007 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 13 [2024-11-27 23:14:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:14:59,007 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-27 23:14:59,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:14:59,007 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-27 23:14:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 23:14:59,008 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:14:59,008 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:14:59,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-27 23:14:59,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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 [2024-11-27 23:14:59,209 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:14:59,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:14:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash -3307942, now seen corresponding path program 1 times [2024-11-27 23:14:59,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:14:59,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093103749] [2024-11-27 23:14:59,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:14:59,210 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 [2024-11-27 23:14:59,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:14:59,214 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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) [2024-11-27 23:14:59,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-27 23:14:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:14:59,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-27 23:14:59,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:15:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:15:20,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:15:30,767 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:15:34,801 WARN L851 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2024-11-27 23:15:38,832 WARN L873 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2024-11-27 23:15:46,897 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:15:57,148 WARN L286 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:16:01,184 WARN L851 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2024-11-27 23:16:05,215 WARN L873 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2024-11-27 23:16:13,344 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:16:21,464 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:16:29,532 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:16:33,581 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) is different from true [2024-11-27 23:16:41,708 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:16:48,926 WARN L286 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:16:57,002 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:17:05,126 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:17:13,249 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:17:21,322 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:17:29,448 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:17:37,573 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:17:45,643 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:17:53,777 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:18:01,896 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:18:09,973 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:18:18,135 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:18:26,264 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:18:34,333 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:18:42,412 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:18:50,543 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:18:58,667 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:19:02,711 WARN L873 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0)))))) is different from true [2024-11-27 23:19:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-27 23:19:11,825 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:19:11,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093103749] [2024-11-27 23:19:11,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093103749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:19:11,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:19:11,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2024-11-27 23:19:11,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187281262] [2024-11-27 23:19:11,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:19:11,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-27 23:19:11,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:19:11,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-27 23:19:11,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=81, Unknown=9, NotChecked=92, Total=240 [2024-11-27 23:19:11,829 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:19:14,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:19:17,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:19:22,866 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-27 23:19:33,358 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq |c_ULTIMATE.start_main_~main__E1~0#1| .cse0) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)))) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.geq |c_ULTIMATE.start_main_~main__E1~0#1| .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-27 23:20:01,551 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |c_ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1) (= |c_ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_13| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_13|) |c_ULTIMATE.start_main_~main__E0~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-27 23:20:05,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:20:09,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:20:13,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:20:15,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:20:23,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:20:25,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:20:26,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:20:30,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:20:34,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:20:38,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:20:42,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:20:46,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:20:51,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:20:55,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:20:58,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:21:02,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:21:05,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:21:09,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:21:23,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:21:25,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:21:36,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:21:40,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 23:21:44,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:21:48,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 23:21:48,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:21:48,372 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2024-11-27 23:21:48,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 23:21:48,436 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-27 23:21:48,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:21:48,437 INFO L225 Difference]: With dead ends: 74 [2024-11-27 23:21:48,437 INFO L226 Difference]: Without dead ends: 56 [2024-11-27 23:21:48,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 108.7s TimeCoverageRelationStatistics Valid=118, Invalid=169, Unknown=13, NotChecked=252, Total=552 [2024-11-27 23:21:48,439 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 95.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 95.6s IncrementalHoareTripleChecker+Time [2024-11-27 23:21:48,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 65 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 17 Unknown, 277 Unchecked, 95.6s Time] [2024-11-27 23:21:48,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-27 23:21:48,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2024-11-27 23:21:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:21:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-27 23:21:48,445 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2024-11-27 23:21:48,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:21:48,446 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-27 23:21:48,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:21:48,447 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-27 23:21:48,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 23:21:48,448 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:21:48,448 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:21:48,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-27 23:21:48,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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 [2024-11-27 23:21:48,649 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:21:48,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:21:48,650 INFO L85 PathProgramCache]: Analyzing trace with hash -530303885, now seen corresponding path program 1 times [2024-11-27 23:21:48,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:21:48,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634547283] [2024-11-27 23:21:48,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:21:48,650 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 [2024-11-27 23:21:48,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 23:21:48,653 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/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) [2024-11-27 23:21:48,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0ea8044-3f38-4373-bc5b-00e812dd8eff/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-27 23:21:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:21:50,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-27 23:21:50,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:22:04,627 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:22:12,782 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:22:19,949 WARN L286 SmtUtils]: Spent 7.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:22:28,102 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:22:36,196 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:22:40,264 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__E1~0#1_12| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0))) (and (fp.leq |v_ULTIMATE.start_main_~main__E1~0#1_12| .cse0) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse1) (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse2 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) |v_ULTIMATE.start_main_~main__E1~0#1_12|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |v_ULTIMATE.start_main_~main__E1~0#1_12|)) (fp.geq |v_ULTIMATE.start_main_~main__E1~0#1_12| .cse1) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-27 23:22:48,454 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:22:56,624 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:23:04,788 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:23:12,956 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:23:21,058 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:23:33,295 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:23:41,403 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:23:49,573 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:23:57,735 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:24:05,913 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:24:09,964 WARN L851 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__E1~0#1_12| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse3))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse1 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) |v_ULTIMATE.start_main_~main__E1~0#1_12|) .cse2)))) |ULTIMATE.start_main_~main__E0~0#1|) |v_ULTIMATE.start_main_~main__E1~0#1_12|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.leq |v_ULTIMATE.start_main_~main__E1~0#1_12| .cse3) (fp.geq |v_ULTIMATE.start_main_~main__E1~0#1_12| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) is different from false [2024-11-27 23:24:13,999 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__E1~0#1_12| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse3))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse1 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) |v_ULTIMATE.start_main_~main__E1~0#1_12|) .cse2)))) |ULTIMATE.start_main_~main__E0~0#1|) |v_ULTIMATE.start_main_~main__E1~0#1_12|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.leq |v_ULTIMATE.start_main_~main__E1~0#1_12| .cse3) (fp.geq |v_ULTIMATE.start_main_~main__E1~0#1_12| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) is different from true [2024-11-27 23:24:26,181 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:24:33,567 WARN L286 SmtUtils]: Spent 7.39s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:24:39,552 WARN L286 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:24:47,679 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:24:55,809 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:25:07,983 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:25:16,077 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:25:24,227 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:25:32,380 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:25:40,529 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:25:52,714 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:26:00,806 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:26:08,960 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:26:17,113 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:26:25,259 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:26:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-27 23:26:25,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:26:33,500 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:26:37,547 WARN L851 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2024-11-27 23:26:41,593 WARN L873 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2024-11-27 23:26:49,700 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:26:57,879 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:27:05,986 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:27:10,038 WARN L851 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2024-11-27 23:27:14,097 WARN L873 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2024-11-27 23:27:22,293 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:27:30,496 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:27:38,594 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:27:42,659 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) is different from true [2024-11-27 23:27:50,825 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:27:59,008 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:28:07,157 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:28:15,390 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:28:23,581 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:28:31,695 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:28:39,893 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:28:48,071 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:28:56,183 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:01,606 WARN L286 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:09,732 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:17,812 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:21,880 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg .cse1)) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse1)))) is different from true [2024-11-27 23:29:30,028 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:38,176 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:46,258 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:29:50,334 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 (fp.neg .cse2))) (or (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse1) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse2)) (not (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| .cse1))))) is different from true [2024-11-27 23:29:58,489 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)