./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.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_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:15:04,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:15:04,381 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 05:15:04,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:15:04,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:15:04,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:15:04,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:15:04,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:15:04,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:15:04,431 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:15:04,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:15:04,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:15:04,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:15:04,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:15:04,433 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:15:04,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:15:04,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 05:15:04,434 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:15:04,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:15:04,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:15:04,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:15:04,435 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 05:15:04,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:15:04,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 05:15:04,435 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:15:04,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 05:15:04,435 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:15:04,435 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:15:04,435 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:15:04,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:15:04,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:15:04,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:15:04,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:15:04,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:15:04,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:15:04,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:15:04,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:15:04,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:15:04,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:15:04,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:15:04,438 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 05:15:04,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 05:15:04,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:15:04,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:15:04,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:15:04,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:15:04,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:15:04,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:15:04,439 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_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2024-11-28 05:15:04,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:15:04,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:15:04,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:15:04,790 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:15:04,791 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:15:04,792 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/interpolation2.c [2024-11-28 05:15:07,899 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/data/71923ec59/22494cc654a74cd6bc44b873d6a671a3/FLAG5cdd20238 [2024-11-28 05:15:08,189 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:15:08,190 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/sv-benchmarks/c/float-benchs/interpolation2.c [2024-11-28 05:15:08,205 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/data/71923ec59/22494cc654a74cd6bc44b873d6a671a3/FLAG5cdd20238 [2024-11-28 05:15:08,472 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/data/71923ec59/22494cc654a74cd6bc44b873d6a671a3 [2024-11-28 05:15:08,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:15:08,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:15:08,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:15:08,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:15:08,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:15:08,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:15:08" (1/1) ... [2024-11-28 05:15:08,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c7b26dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08, skipping insertion in model container [2024-11-28 05:15:08,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:15:08" (1/1) ... [2024-11-28 05:15:08,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:15:08,681 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_51cfdba8-aefc-42a7-85bd-821e6f2efac0/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-28 05:15:08,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:15:08,726 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:15:08,740 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_51cfdba8-aefc-42a7-85bd-821e6f2efac0/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-28 05:15:08,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:15:08,784 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:15:08,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08 WrapperNode [2024-11-28 05:15:08,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:15:08,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:15:08,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:15:08,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:15:08,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08" (1/1) ... [2024-11-28 05:15:08,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08" (1/1) ... [2024-11-28 05:15:08,832 INFO L138 Inliner]: procedures = 18, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 99 [2024-11-28 05:15:08,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:15:08,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:15:08,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:15:08,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:15:08,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08" (1/1) ... [2024-11-28 05:15:08,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08" (1/1) ... [2024-11-28 05:15:08,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08" (1/1) ... [2024-11-28 05:15:08,875 INFO L175 MemorySlicer]: Split 30 memory accesses to 5 slices as follows [2, 8, 6, 8, 6]. 27 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 5, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0, 0]. [2024-11-28 05:15:08,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08" (1/1) ... [2024-11-28 05:15:08,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08" (1/1) ... [2024-11-28 05:15:08,888 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08" (1/1) ... [2024-11-28 05:15:08,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08" (1/1) ... [2024-11-28 05:15:08,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08" (1/1) ... [2024-11-28 05:15:08,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08" (1/1) ... [2024-11-28 05:15:08,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08" (1/1) ... [2024-11-28 05:15:08,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:15:08,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:15:08,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:15:08,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:15:08,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08" (1/1) ... [2024-11-28 05:15:08,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:15:08,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:15:08,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:15:08,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:15:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:15:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:15:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 05:15:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 05:15:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-28 05:15:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-28 05:15:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 05:15:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-28 05:15:08,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-28 05:15:08,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-28 05:15:08,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-28 05:15:08,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-28 05:15:08,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:15:08,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:15:08,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-28 05:15:08,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-28 05:15:08,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-28 05:15:08,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-28 05:15:08,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-28 05:15:08,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:15:09,058 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:15:09,060 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:15:09,205 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-28 05:15:09,205 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:15:09,218 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:15:09,218 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 05:15:09,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:15:09 BoogieIcfgContainer [2024-11-28 05:15:09,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:15:09,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:15:09,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:15:09,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:15:09,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:15:08" (1/3) ... [2024-11-28 05:15:09,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd179e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:15:09, skipping insertion in model container [2024-11-28 05:15:09,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:08" (2/3) ... [2024-11-28 05:15:09,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd179e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:15:09, skipping insertion in model container [2024-11-28 05:15:09,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:15:09" (3/3) ... [2024-11-28 05:15:09,232 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2024-11-28 05:15:09,247 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:15:09,248 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation2.c that has 1 procedures, 17 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 05:15:09,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:15:09,319 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;@763d3aed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:15:09,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 05:15:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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-28 05:15:09,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:15:09,328 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:09,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:09,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:15:09,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:09,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2024-11-28 05:15:09,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:09,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801032805] [2024-11-28 05:15:09,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:09,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:09,518 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-28 05:15:09,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:09,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801032805] [2024-11-28 05:15:09,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801032805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:15:09,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:15:09,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:15:09,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830383554] [2024-11-28 05:15:09,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:15:09,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 05:15:09,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:15:09,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 05:15:09,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:15:09,553 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-28 05:15:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:09,564 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-11-28 05:15:09,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 05:15:09,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-11-28 05:15:09,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:09,571 INFO L225 Difference]: With dead ends: 29 [2024-11-28 05:15:09,571 INFO L226 Difference]: Without dead ends: 13 [2024-11-28 05:15:09,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:15:09,577 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:09,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:15:09,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-28 05:15:09,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-28 05:15:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-28 05:15:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-28 05:15:09,604 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2024-11-28 05:15:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:09,605 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-28 05:15:09,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-28 05:15:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-11-28 05:15:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:15:09,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:09,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:09,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:15:09,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:15:09,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1178843082, now seen corresponding path program 1 times [2024-11-28 05:15:09,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:09,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031859890] [2024-11-28 05:15:09,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:09,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:09,808 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-28 05:15:09,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:09,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031859890] [2024-11-28 05:15:09,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031859890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:15:09,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:15:09,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:15:09,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78316608] [2024-11-28 05:15:09,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:15:09,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:15:09,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:15:09,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:15:09,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:15:09,811 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-28 05:15:09,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:09,845 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2024-11-28 05:15:09,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:15:09,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-11-28 05:15:09,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:09,849 INFO L225 Difference]: With dead ends: 24 [2024-11-28 05:15:09,849 INFO L226 Difference]: Without dead ends: 20 [2024-11-28 05:15:09,849 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-28 05:15:09,850 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:09,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:15:09,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-28 05:15:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2024-11-28 05:15:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-28 05:15:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-11-28 05:15:09,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2024-11-28 05:15:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:09,857 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-28 05:15:09,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-28 05:15:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-11-28 05:15:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 05:15:09,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:09,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:09,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:15:09,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:15:09,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:09,858 INFO L85 PathProgramCache]: Analyzing trace with hash 937322645, now seen corresponding path program 1 times [2024-11-28 05:15:09,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:09,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903405948] [2024-11-28 05:15:09,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:09,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 05:15:09,888 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 05:15:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 05:15:09,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 05:15:09,940 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 05:15:09,941 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 05:15:09,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:15:09,945 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-28 05:15:09,971 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 05:15:09,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:15:09 BoogieIcfgContainer [2024-11-28 05:15:09,979 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 05:15:09,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 05:15:09,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 05:15:09,979 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 05:15:09,980 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:15:09" (3/4) ... [2024-11-28 05:15:09,982 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 05:15:09,984 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 05:15:09,985 INFO L158 Benchmark]: Toolchain (without parser) took 1506.17ms. Allocated memory is still 142.6MB. Free memory was 119.6MB in the beginning and 113.4MB in the end (delta: 6.2MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-28 05:15:09,986 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 142.6MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:15:09,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.76ms. Allocated memory is still 142.6MB. Free memory was 119.6MB in the beginning and 107.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:15:09,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.76ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 106.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:15:09,988 INFO L158 Benchmark]: Boogie Preprocessor took 69.84ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 104.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:15:09,989 INFO L158 Benchmark]: RCFGBuilder took 310.64ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 92.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:15:09,990 INFO L158 Benchmark]: TraceAbstraction took 757.66ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 113.5MB in the end (delta: -21.3MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2024-11-28 05:15:09,990 INFO L158 Benchmark]: Witness Printer took 4.43ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 113.4MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:15:09,993 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 142.6MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.76ms. Allocated memory is still 142.6MB. Free memory was 119.6MB in the beginning and 107.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.76ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 106.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.84ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 104.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 310.64ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 92.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 757.66ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 113.5MB in the end (delta: -21.3MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * Witness Printer took 4.43ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 113.4MB in the end (delta: 21.0kB). 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: 9]: 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 someBinaryFLOATComparisonOperation at line 21, overapproximation of someBinaryFLOATComparisonOperation at line 24, overapproximation of someBinaryFLOATComparisonOperation at line 21, overapproximation of someBinaryFLOATComparisonOperation at line 28, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 26. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L20] t = __VERIFIER_nondet_float() [L21] EXPR min[0] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] VAL [max={7:0}] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] VAL [max={7:0}] [L21] CALL assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L7] COND FALSE !(!cond) [L21] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L23] i = 0 VAL [i=0, max={7:0}] [L23] COND TRUE i < sizeof(min) / sizeof(min[0]) VAL [i=0, max={7:0}] [L24] EXPR max[i] [L24] COND TRUE t <= max[i] [L26] EXPR org[i] [L26] EXPR slope[i] [L26] EXPR min[i] [L26] EXPR max[i] [L26] EXPR min[i] [L26] z = org[i] + slope[i] * (t - min[i]) / (max[i] - min[i]) [L28] CALL __VERIFIER_assert(z >= -10.f && z <= 30.f) [L9] COND TRUE !(cond) [L9] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 31 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 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-28 05:15:10,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:15:12,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:15:12,762 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 05:15:12,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:15:12,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:15:12,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:15:12,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:15:12,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:15:12,811 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:15:12,812 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:15:12,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:15:12,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:15:12,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:15:12,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:15:12,814 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:15:12,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:15:12,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 05:15:12,815 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:15:12,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:15:12,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:15:12,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 05:15:12,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:15:12,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 05:15:12,816 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:15:12,816 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 05:15:12,816 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 05:15:12,816 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:15:12,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 05:15:12,816 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:15:12,816 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:15:12,817 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:15:12,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:15:12,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:15:12,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:15:12,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:15:12,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:15:12,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:15:12,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:15:12,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:15:12,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:15:12,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:15:12,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:15:12,819 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 05:15:12,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 05:15:12,820 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 05:15:12,820 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 05:15:12,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:15:12,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:15:12,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:15:12,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:15:12,821 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_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2024-11-28 05:15:13,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:15:13,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:15:13,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:15:13,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:15:13,179 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:15:13,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/interpolation2.c [2024-11-28 05:15:16,349 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/data/d612f4943/c5f8af0dea4d4820abd9074d7ba0f17e/FLAGfc15ea007 [2024-11-28 05:15:16,608 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:15:16,609 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/sv-benchmarks/c/float-benchs/interpolation2.c [2024-11-28 05:15:16,617 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/data/d612f4943/c5f8af0dea4d4820abd9074d7ba0f17e/FLAGfc15ea007 [2024-11-28 05:15:16,644 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/data/d612f4943/c5f8af0dea4d4820abd9074d7ba0f17e [2024-11-28 05:15:16,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:15:16,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:15:16,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:15:16,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:15:16,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:15:16,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:15:16" (1/1) ... [2024-11-28 05:15:16,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f54f7d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16, skipping insertion in model container [2024-11-28 05:15:16,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:15:16" (1/1) ... [2024-11-28 05:15:16,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:15:16,858 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_51cfdba8-aefc-42a7-85bd-821e6f2efac0/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-28 05:15:16,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:15:16,920 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:15:16,934 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_51cfdba8-aefc-42a7-85bd-821e6f2efac0/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2024-11-28 05:15:16,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:15:16,991 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:15:16,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16 WrapperNode [2024-11-28 05:15:16,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:15:16,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:15:16,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:15:16,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:15:17,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16" (1/1) ... [2024-11-28 05:15:17,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16" (1/1) ... [2024-11-28 05:15:17,055 INFO L138 Inliner]: procedures = 19, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-11-28 05:15:17,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:15:17,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:15:17,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:15:17,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:15:17,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16" (1/1) ... [2024-11-28 05:15:17,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16" (1/1) ... [2024-11-28 05:15:17,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16" (1/1) ... [2024-11-28 05:15:17,093 INFO L175 MemorySlicer]: Split 30 memory accesses to 5 slices as follows [2, 8, 6, 6, 8]. 27 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 5, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0, 0]. [2024-11-28 05:15:17,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16" (1/1) ... [2024-11-28 05:15:17,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16" (1/1) ... [2024-11-28 05:15:17,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16" (1/1) ... [2024-11-28 05:15:17,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16" (1/1) ... [2024-11-28 05:15:17,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16" (1/1) ... [2024-11-28 05:15:17,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16" (1/1) ... [2024-11-28 05:15:17,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16" (1/1) ... [2024-11-28 05:15:17,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:15:17,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:15:17,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:15:17,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:15:17,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16" (1/1) ... [2024-11-28 05:15:17,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:15:17,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:15:17,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:15:17,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:15:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:15:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-28 05:15:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-28 05:15:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-28 05:15:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-28 05:15:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-28 05:15:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 05:15:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 05:15:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-28 05:15:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-28 05:15:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-28 05:15:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 05:15:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-28 05:15:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-28 05:15:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-28 05:15:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-28 05:15:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-28 05:15:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:15:17,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:15:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:15:17,303 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:15:17,305 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:15:21,794 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-28 05:15:21,794 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:15:21,804 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:15:21,805 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 05:15:21,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:15:21 BoogieIcfgContainer [2024-11-28 05:15:21,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:15:21,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:15:21,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:15:21,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:15:21,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:15:16" (1/3) ... [2024-11-28 05:15:21,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef89916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:15:21, skipping insertion in model container [2024-11-28 05:15:21,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:15:16" (2/3) ... [2024-11-28 05:15:21,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef89916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:15:21, skipping insertion in model container [2024-11-28 05:15:21,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:15:21" (3/3) ... [2024-11-28 05:15:21,820 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2024-11-28 05:15:21,833 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:15:21,835 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation2.c that has 1 procedures, 17 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 05:15:21,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:15:21,905 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;@21c5460f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:15:21,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 05:15:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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-28 05:15:21,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:15:21,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:21,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:21,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:15:21,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:21,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2024-11-28 05:15:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:15:21,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992152213] [2024-11-28 05:15:21,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:21,945 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-28 05:15:21,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 05:15:21,950 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:15:21,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:15:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:22,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 05:15:22,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:15:22,474 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-28 05:15:22,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:15:22,474 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:15:22,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992152213] [2024-11-28 05:15:22,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992152213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:15:22,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:15:22,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:15:22,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838101094] [2024-11-28 05:15:22,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:15:22,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 05:15:22,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:15:22,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 05:15:22,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:15:22,501 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-28 05:15:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:22,513 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-11-28 05:15:22,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 05:15:22,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-11-28 05:15:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:22,521 INFO L225 Difference]: With dead ends: 29 [2024-11-28 05:15:22,521 INFO L226 Difference]: Without dead ends: 13 [2024-11-28 05:15:22,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:15:22,526 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:22,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:15:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-28 05:15:22,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-28 05:15:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-28 05:15:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-28 05:15:22,557 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2024-11-28 05:15:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:22,557 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-28 05:15:22,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-28 05:15:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-11-28 05:15:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:15:22,559 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:22,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:22,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:15:22,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:15:22,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:15:22,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:22,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1178843082, now seen corresponding path program 1 times [2024-11-28 05:15:22,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:15:22,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800424240] [2024-11-28 05:15:22,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:22,762 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-28 05:15:22,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 05:15:22,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:15:22,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:15:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:23,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 05:15:23,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:15:23,281 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-28 05:15:23,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:15:23,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:15:23,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800424240] [2024-11-28 05:15:23,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800424240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:15:23,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:15:23,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:15:23,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649017071] [2024-11-28 05:15:23,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:15:23,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:15:23,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:15:23,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:15:23,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:15:23,287 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-28 05:15:27,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:15:31,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:15:35,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:15:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:35,727 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-28 05:15:35,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:15:35,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-11-28 05:15:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:35,771 INFO L225 Difference]: With dead ends: 21 [2024-11-28 05:15:35,771 INFO L226 Difference]: Without dead ends: 17 [2024-11-28 05:15:35,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-28 05:15:35,772 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:35,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 20 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2024-11-28 05:15:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-28 05:15:35,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2024-11-28 05:15:35,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-28 05:15:35,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-11-28 05:15:35,783 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2024-11-28 05:15:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:35,783 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-28 05:15:35,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-28 05:15:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-11-28 05:15:35,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 05:15:35,784 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:35,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:35,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:15:35,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:15:35,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:15:35,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:35,985 INFO L85 PathProgramCache]: Analyzing trace with hash 937322645, now seen corresponding path program 1 times [2024-11-28 05:15:35,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:15:35,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468065484] [2024-11-28 05:15:35,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:35,986 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-28 05:15:35,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 05:15:35,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:15:35,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:15:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:36,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 05:15:36,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:15:41,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 499 treesize of output 379 [2024-11-28 05:15:41,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 382 treesize of output 322 [2024-11-28 05:15:41,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:41,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 378 treesize of output 294 [2024-11-28 05:15:42,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 226 [2024-11-28 05:15:47,744 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:15:55,814 WARN L286 SmtUtils]: Spent 8.07s 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-28 05:16:03,977 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:16:17,709 WARN L286 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:16:25,863 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:16:32,708 WARN L286 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:16:40,777 WARN L286 SmtUtils]: Spent 8.07s 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-28 05:16:46,178 WARN L286 SmtUtils]: Spent 5.40s 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-28 05:16:54,342 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:17:00,007 WARN L286 SmtUtils]: Spent 5.66s 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-28 05:17:05,822 WARN L286 SmtUtils]: Spent 5.81s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:17:16,815 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:17:22,924 WARN L286 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:17:30,987 WARN L286 SmtUtils]: Spent 8.06s 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-28 05:17:38,303 WARN L286 SmtUtils]: Spent 7.32s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:17:45,870 WARN L286 SmtUtils]: Spent 7.57s 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-28 05:17:53,157 WARN L286 SmtUtils]: Spent 7.29s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:18:06,027 WARN L286 SmtUtils]: Spent 5.97s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:18:16,502 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:18:23,248 WARN L286 SmtUtils]: Spent 6.73s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:18:31,319 WARN L286 SmtUtils]: Spent 8.07s 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-28 05:18:37,446 WARN L286 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:18:42,723 WARN L286 SmtUtils]: Spent 5.28s 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-28 05:18:50,858 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:18:58,980 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:19:11,700 WARN L286 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:19:24,195 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:19:30,643 WARN L286 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:19:43,247 WARN L286 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:19:50,695 WARN L286 SmtUtils]: Spent 7.45s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:19:58,775 WARN L286 SmtUtils]: Spent 8.08s 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-28 05:20:04,687 WARN L286 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:20:17,685 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:20:25,803 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:20:29,864 WARN L851 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse2)) (fp.sub roundNearestTiesToEven .cse3 .cse2))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1) (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse2) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse3) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2024-11-28 05:20:40,158 WARN L286 SmtUtils]: Spent 6.25s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:20:46,862 WARN L286 SmtUtils]: Spent 6.70s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:20:54,962 WARN L286 SmtUtils]: Spent 8.10s 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-28 05:21:02,167 WARN L286 SmtUtils]: Spent 7.20s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:21:10,244 WARN L286 SmtUtils]: Spent 8.08s 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-28 05:21:18,398 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:21:26,520 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:21:30,570 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse2)) (fp.sub roundNearestTiesToEven .cse3 .cse2))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1) (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse2) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse3) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3)))) is different from false [2024-11-28 05:21:34,381 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-28 05:21:34,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:21:34,382 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:21:34,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468065484] [2024-11-28 05:21:34,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468065484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:34,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:34,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:21:34,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203693455] [2024-11-28 05:21:34,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:34,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:21:34,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:21:34,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:21:34,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=63, Unknown=2, NotChecked=34, Total=132 [2024-11-28 05:21:34,384 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-28 05:21:39,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:21:41,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:21:46,070 WARN L851 $PredicateComparison]: unable to prove that (and (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_9| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_9| .cse2)) (fp.sub roundNearestTiesToEven .cse3 .cse2))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1) (fp.geq |v_ULTIMATE.start_main_~t~0#1_9| .cse2) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.leq |v_ULTIMATE.start_main_~t~0#1_9| .cse3) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-28 05:21:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:46,142 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-11-28 05:21:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:21:46,144 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 12 [2024-11-28 05:21:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:46,144 INFO L225 Difference]: With dead ends: 28 [2024-11-28 05:21:46,145 INFO L226 Difference]: Without dead ends: 24 [2024-11-28 05:21:46,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=35, Invalid=64, Unknown=3, NotChecked=54, Total=156 [2024-11-28 05:21:46,146 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:46,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 26 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 1 Unknown, 65 Unchecked, 7.6s Time] [2024-11-28 05:21:46,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-28 05:21:46,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2024-11-28 05:21:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-28 05:21:46,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-28 05:21:46,153 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2024-11-28 05:21:46,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:46,153 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-28 05:21:46,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-28 05:21:46,154 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-28 05:21:46,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 05:21:46,154 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:46,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:21:46,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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)] Forceful destruction successful, exit code 0 [2024-11-28 05:21:46,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:21:46,359 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:21:46,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:46,360 INFO L85 PathProgramCache]: Analyzing trace with hash 544295635, now seen corresponding path program 1 times [2024-11-28 05:21:46,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:21:46,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773348452] [2024-11-28 05:21:46,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:46,360 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-28 05:21:46,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 05:21:46,363 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:21:46,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:21:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:46,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:21:46,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:46,924 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-28 05:21:46,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:21:46,924 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:21:46,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773348452] [2024-11-28 05:21:46,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773348452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:46,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:46,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:21:46,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31671143] [2024-11-28 05:21:46,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:46,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:21:46,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:21:46,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:21:46,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:21:46,926 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 05:21:47,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:47,009 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-11-28 05:21:47,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:21:47,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-11-28 05:21:47,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:47,010 INFO L225 Difference]: With dead ends: 27 [2024-11-28 05:21:47,011 INFO L226 Difference]: Without dead ends: 16 [2024-11-28 05:21:47,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:21:47,012 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:47,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:21:47,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-28 05:21:47,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-28 05:21:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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-28 05:21:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-28 05:21:47,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2024-11-28 05:21:47,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:47,018 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-28 05:21:47,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-28 05:21:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-28 05:21:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 05:21:47,019 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:47,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:21:47,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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)] Ended with exit code 0 [2024-11-28 05:21:47,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:21:47,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:21:47,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:47,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1006252641, now seen corresponding path program 1 times [2024-11-28 05:21:47,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:21:47,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795073987] [2024-11-28 05:21:47,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:47,221 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-28 05:21:47,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 05:21:47,223 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:21:47,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:21:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:47,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:21:47,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:47,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:47,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:21:47,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:47,943 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:21:47,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795073987] [2024-11-28 05:21:47,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795073987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:21:47,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:21:47,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-28 05:21:47,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082268126] [2024-11-28 05:21:47,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:21:47,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:21:47,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:21:47,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:21:47,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:21:47,944 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-28 05:21:52,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:21:56,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:22:00,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:22:05,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:22:09,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:22:13,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:22:13,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:13,518 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-11-28 05:22:13,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:22:13,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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) Word has length 13 [2024-11-28 05:22:13,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:13,573 INFO L225 Difference]: With dead ends: 30 [2024-11-28 05:22:13,573 INFO L226 Difference]: Without dead ends: 26 [2024-11-28 05:22:13,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:22:13,574 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:13,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 25 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 6 Unknown, 0 Unchecked, 25.5s Time] [2024-11-28 05:22:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-28 05:22:13,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-28 05:22:13,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 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-28 05:22:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-28 05:22:13,584 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2024-11-28 05:22:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:13,584 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-28 05:22:13,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-28 05:22:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-28 05:22:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 05:22:13,585 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:13,585 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:13,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:22:13,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:22:13,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:22:13,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:13,786 INFO L85 PathProgramCache]: Analyzing trace with hash -706988098, now seen corresponding path program 1 times [2024-11-28 05:22:13,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:13,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373874641] [2024-11-28 05:22:13,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:13,787 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-28 05:22:13,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 05:22:13,788 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:22:13,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51cfdba8-aefc-42a7-85bd-821e6f2efac0/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-28 05:22:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:14,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-28 05:22:14,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:21,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:21,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 501 treesize of output 381 [2024-11-28 05:22:21,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 382 treesize of output 322 [2024-11-28 05:22:21,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:21,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 423 treesize of output 315 [2024-11-28 05:22:21,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 226 [2024-11-28 05:22:30,095 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:22:37,390 WARN L286 SmtUtils]: Spent 7.29s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:22:44,301 WARN L286 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:22:50,595 WARN L286 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:22:56,703 WARN L286 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:23:03,762 WARN L286 SmtUtils]: Spent 7.06s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:23:11,798 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:23:19,212 WARN L286 SmtUtils]: Spent 7.38s 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-28 05:23:31,316 WARN L286 SmtUtils]: Spent 7.76s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:23:37,125 WARN L286 SmtUtils]: Spent 5.81s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:23:45,244 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:23:53,285 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:24:01,004 WARN L286 SmtUtils]: Spent 7.68s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:24:08,270 WARN L286 SmtUtils]: Spent 7.27s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:24:14,681 WARN L286 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:24:21,698 WARN L286 SmtUtils]: Spent 7.02s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:24:29,782 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:24:36,870 WARN L286 SmtUtils]: Spent 7.09s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:24:44,878 WARN L286 SmtUtils]: Spent 8.00s 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-28 05:24:55,546 WARN L286 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:25:03,137 WARN L286 SmtUtils]: Spent 7.59s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:25:10,201 WARN L286 SmtUtils]: Spent 7.06s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:25:18,367 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:25:26,414 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:25:34,560 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:25:41,290 WARN L286 SmtUtils]: Spent 6.73s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:25:47,753 WARN L286 SmtUtils]: Spent 6.46s 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-28 05:26:04,130 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:26:15,687 WARN L286 SmtUtils]: Spent 7.83s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:26:21,604 WARN L286 SmtUtils]: Spent 5.89s 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-28 05:26:26,763 WARN L286 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:26:33,045 WARN L286 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:26:41,158 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:26:52,749 WARN L286 SmtUtils]: Spent 7.16s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:27:03,558 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:27:10,947 WARN L286 SmtUtils]: Spent 7.39s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:27:25,855 WARN L286 SmtUtils]: Spent 7.01s 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-28 05:27:32,751 WARN L286 SmtUtils]: Spent 6.90s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:27:40,837 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:27:48,970 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:27:57,155 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:28:05,227 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:28:13,302 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:28:19,049 WARN L286 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:28:25,540 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)) .cse2) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (= .cse3 .cse4) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse5)) (= .cse4 .cse5) (not (fp.geq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse3)) (fp.sub roundNearestTiesToEven .cse0 .cse3))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2024-11-28 05:28:36,985 WARN L286 SmtUtils]: Spent 7.41s 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-28 05:28:45,059 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:28:51,611 WARN L286 SmtUtils]: Spent 6.55s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:28:59,735 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:29:07,965 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:29:16,038 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:29:24,117 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:29:30,513 WARN L286 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:29:34,561 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)) .cse2) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (= .cse3 .cse4) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse5)) (= .cse4 .cse5) (not (fp.geq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse3)) (fp.sub roundNearestTiesToEven .cse0 .cse3))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0))))))) is different from false [2024-11-28 05:29:38,576 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_10| (_ FloatingPoint 8 24)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)) .cse2) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (= .cse3 .cse4) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_10| .cse5)) (= .cse4 .cse5) (not (fp.geq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~t~0#1_10| .cse3)) (fp.sub roundNearestTiesToEven .cse0 .cse3))) (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 10.0))))))) is different from true [2024-11-28 05:29:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:29:38,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:29:47,063 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:29:55,298 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:29:59,361 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) is different from false [2024-11-28 05:30:03,427 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) is different from true [2024-11-28 05:30:11,680 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:30:19,923 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:30:28,158 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 05:30:32,234 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|))) is different from false [2024-11-28 05:30:36,303 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|))) is different from true