./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC --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 a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:01:01,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:01:01,522 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 01:01:01,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:01:01,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:01:01,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:01:01,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:01:01,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:01:01,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:01:01,571 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:01:01,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:01:01,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:01:01,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:01:01,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:01:01,573 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:01:01,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:01:01,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:01:01,574 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:01:01,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:01:01,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:01:01,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:01:01,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:01:01,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:01:01,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:01:01,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:01:01,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:01:01,574 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:01:01,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:01:01,575 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:01:01,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:01:01,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:01:01,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:01:01,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:01:01,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:01:01,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:01:01,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:01:01,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:01:01,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:01:01,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:01:01,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:01:01,577 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:01:01,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:01:01,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:01:01,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:01:01,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:01:01,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:01:01,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:01:01,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:01:01,578 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_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC 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 -> a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e [2024-11-24 01:01:01,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:01:01,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:01:01,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:01:01,982 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:01:01,983 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:01:01,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2024-11-24 01:01:05,118 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/data/6ada541f2/3748675c7a414f488e37d3f9044f43f5/FLAGfe9269471 [2024-11-24 01:01:05,411 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:01:05,412 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2024-11-24 01:01:05,423 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/data/6ada541f2/3748675c7a414f488e37d3f9044f43f5/FLAGfe9269471 [2024-11-24 01:01:05,706 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/data/6ada541f2/3748675c7a414f488e37d3f9044f43f5 [2024-11-24 01:01:05,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:01:05,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:01:05,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:01:05,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:01:05,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:01:05,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:01:05" (1/1) ... [2024-11-24 01:01:05,717 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c961d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05, skipping insertion in model container [2024-11-24 01:01:05,717 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:01:05" (1/1) ... [2024-11-24 01:01:05,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:01:05,923 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_4af720d3-35e9-4043-9058-675fa5cbfb87/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2024-11-24 01:01:05,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:01:05,945 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:01:05,971 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_4af720d3-35e9-4043-9058-675fa5cbfb87/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2024-11-24 01:01:05,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:01:05,990 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:01:05,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05 WrapperNode [2024-11-24 01:01:05,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:01:05,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:01:05,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:01:05,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:01:06,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05" (1/1) ... [2024-11-24 01:01:06,010 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05" (1/1) ... [2024-11-24 01:01:06,032 INFO L138 Inliner]: procedures = 18, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 150 [2024-11-24 01:01:06,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:01:06,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:01:06,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:01:06,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:01:06,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05" (1/1) ... [2024-11-24 01:01:06,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05" (1/1) ... [2024-11-24 01:01:06,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05" (1/1) ... [2024-11-24 01:01:06,059 INFO L175 MemorySlicer]: Split 30 memory accesses to 5 slices as follows [2, 6, 8, 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-24 01:01:06,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05" (1/1) ... [2024-11-24 01:01:06,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05" (1/1) ... [2024-11-24 01:01:06,070 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05" (1/1) ... [2024-11-24 01:01:06,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05" (1/1) ... [2024-11-24 01:01:06,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05" (1/1) ... [2024-11-24 01:01:06,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05" (1/1) ... [2024-11-24 01:01:06,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05" (1/1) ... [2024-11-24 01:01:06,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:01:06,080 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:01:06,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:01:06,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:01:06,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05" (1/1) ... [2024-11-24 01:01:06,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:01:06,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:01:06,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:01:06,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:01:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:01:06,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 01:01:06,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-24 01:01:06,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-24 01:01:06,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-24 01:01:06,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-24 01:01:06,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-24 01:01:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-24 01:01:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-24 01:01:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-24 01:01:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-24 01:01:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-24 01:01:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:01:06,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:01:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-24 01:01:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-24 01:01:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-24 01:01:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-24 01:01:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-24 01:01:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-24 01:01:06,283 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:01:06,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:01:06,505 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-24 01:01:06,505 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:01:06,514 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:01:06,514 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 01:01:06,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:01:06 BoogieIcfgContainer [2024-11-24 01:01:06,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:01:06,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:01:06,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:01:06,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:01:06,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:01:05" (1/3) ... [2024-11-24 01:01:06,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1872ed37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:01:06, skipping insertion in model container [2024-11-24 01:01:06,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:05" (2/3) ... [2024-11-24 01:01:06,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1872ed37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:01:06, skipping insertion in model container [2024-11-24 01:01:06,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:01:06" (3/3) ... [2024-11-24 01:01:06,525 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+cfa-reducer.c [2024-11-24 01:01:06,539 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:01:06,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation2.c.v+cfa-reducer.c that has 1 procedures, 18 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-24 01:01:06,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:01:06,610 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;@60a658b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:01:06,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:01:06,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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-24 01:01:06,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-24 01:01:06,621 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:06,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:06,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:01:06,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:06,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2024-11-24 01:01:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:06,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946576176] [2024-11-24 01:01:06,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:06,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:06,989 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-24 01:01:06,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:06,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946576176] [2024-11-24 01:01:06,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946576176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:06,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:06,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:01:06,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025165573] [2024-11-24 01:01:06,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:07,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:01:07,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:07,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:01:07,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:01:07,025 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-24 01:01:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:07,091 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-11-24 01:01:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:01:07,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-24 01:01:07,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:07,102 INFO L225 Difference]: With dead ends: 25 [2024-11-24 01:01:07,102 INFO L226 Difference]: Without dead ends: 15 [2024-11-24 01:01:07,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:01:07,109 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:07,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:01:07,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-24 01:01:07,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-24 01:01:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 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-24 01:01:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-24 01:01:07,139 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2024-11-24 01:01:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:07,139 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-24 01:01:07,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-24 01:01:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-11-24 01:01:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-24 01:01:07,140 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:07,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:07,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 01:01:07,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:01:07,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:07,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1736001843, now seen corresponding path program 1 times [2024-11-24 01:01:07,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:07,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300376463] [2024-11-24 01:01:07,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:07,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:07,303 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-24 01:01:07,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:07,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300376463] [2024-11-24 01:01:07,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300376463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:07,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:07,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:01:07,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073760828] [2024-11-24 01:01:07,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:07,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:01:07,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:07,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:01:07,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:01:07,306 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-24 01:01:07,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:07,323 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-24 01:01:07,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:01:07,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-24 01:01:07,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:07,324 INFO L225 Difference]: With dead ends: 33 [2024-11-24 01:01:07,324 INFO L226 Difference]: Without dead ends: 25 [2024-11-24 01:01:07,324 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-24 01:01:07,325 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:07,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 27 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:01:07,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-24 01:01:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2024-11-24 01:01:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 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-24 01:01:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-24 01:01:07,330 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2024-11-24 01:01:07,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:07,330 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-24 01:01:07,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-24 01:01:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-24 01:01:07,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-24 01:01:07,331 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:07,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:07,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 01:01:07,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:01:07,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:07,336 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2024-11-24 01:01:07,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:07,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339603240] [2024-11-24 01:01:07,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:07,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:01:07,389 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 01:01:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:01:07,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 01:01:07,443 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 01:01:07,444 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 01:01:07,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 01:01:07,449 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-24 01:01:07,474 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 01:01:07,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:01:07 BoogieIcfgContainer [2024-11-24 01:01:07,478 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 01:01:07,479 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 01:01:07,479 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 01:01:07,479 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 01:01:07,480 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:01:06" (3/4) ... [2024-11-24 01:01:07,482 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 01:01:07,483 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 01:01:07,484 INFO L158 Benchmark]: Toolchain (without parser) took 1775.08ms. Allocated memory is still 142.6MB. Free memory was 117.3MB in the beginning and 50.4MB in the end (delta: 66.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-24 01:01:07,485 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 117.4MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:01:07,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.27ms. Allocated memory is still 142.6MB. Free memory was 117.0MB in the beginning and 105.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:01:07,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.51ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 103.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:01:07,486 INFO L158 Benchmark]: Boogie Preprocessor took 45.94ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 101.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:01:07,486 INFO L158 Benchmark]: RCFGBuilder took 434.45ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 89.2MB in the end (delta: 12.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:01:07,487 INFO L158 Benchmark]: TraceAbstraction took 960.97ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 50.6MB in the end (delta: 38.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-24 01:01:07,487 INFO L158 Benchmark]: Witness Printer took 4.77ms. Allocated memory is still 142.6MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:01:07,489 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.39ms. Allocated memory is still 117.4MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.27ms. Allocated memory is still 142.6MB. Free memory was 117.0MB in the beginning and 105.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.51ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 103.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.94ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 101.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 434.45ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 89.2MB in the end (delta: 12.7MB). There was no memory consumed. Max. memory is 16.1GB. * TraceAbstraction took 960.97ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 50.6MB in the end (delta: 38.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 4.77ms. Allocated memory is still 142.6MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 53]: 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 35, overapproximation of someBinaryFLOATComparisonOperation at line 26, overapproximation of someBinaryFLOATComparisonOperation at line 24, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L1] int __return_main; [L12] int __return_129; VAL [__return_129=0, __return_main=0] [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L22] main__t = __VERIFIER_nondet_float() [L23] int main____CPAchecker_TMP_0; [L24] EXPR main__min[0] VAL [__return_129=0, __return_main=0] [L24] COND TRUE main__t >= (main__min[0]) [L26] EXPR main__max[4UL] VAL [__return_129=0, __return_main=0] [L26] COND TRUE main__t <= (main__max[4UL]) [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_129=0, __return_main=0, main____CPAchecker_TMP_0=1, main__max={6:0}] [L29] COND TRUE main____CPAchecker_TMP_0 != 0 [L31] main__i = 0 VAL [__return_129=0, __return_main=0, main__i=0, main__max={6:0}] [L33] COND TRUE main__i < 5UL [L35] EXPR main__max[main__i] VAL [__return_129=0, __return_main=0] [L35] COND TRUE main__t <= (main__max[main__i]) [L38] EXPR main__org[main__i] [L38] EXPR main__slope[main__i] [L38] EXPR main__min[main__i] [L38] EXPR main__max[main__i] [L38] EXPR main__min[main__i] [L38] main__z = (main__org[main__i]) + (((main__slope[main__i]) * (main__t - (main__min[main__i]))) / ((main__max[main__i]) - (main__min[main__i]))) [L39] int main____CPAchecker_TMP_1; VAL [__return_129=0, __return_main=0, main__i=0, main__max={6:0}] [L40] COND FALSE !(main__z >= -10.0) VAL [__return_129=0, __return_main=0, main__i=0, main__max={6:0}] [L66] main____CPAchecker_TMP_1 = 0 VAL [__return_129=0, __return_main=0, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}] [L47] int __tmp_1; [L48] __tmp_1 = main____CPAchecker_TMP_1 [L49] int __VERIFIER_assert__cond; [L50] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_129=0, __return_main=0, main__i=0, main__max={6:0}] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_129=0, __return_main=0, main__i=0, main__max={6:0}] [L53] reach_error() VAL [__return_129=0, __return_main=0, main__i=0, main__max={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 35 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 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-24 01:01:07,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC --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 a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:01:10,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:01:10,553 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-24 01:01:10,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:01:10,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:01:10,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:01:10,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:01:10,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:01:10,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:01:10,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:01:10,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:01:10,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:01:10,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:01:10,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:01:10,613 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:01:10,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:01:10,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:01:10,614 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:01:10,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:01:10,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:01:10,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:01:10,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:01:10,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:01:10,615 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 01:01:10,615 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 01:01:10,616 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 01:01:10,616 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:01:10,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:01:10,616 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:01:10,616 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:01:10,616 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:01:10,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:01:10,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:01:10,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:01:10,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:01:10,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:01:10,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:01:10,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:01:10,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:01:10,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:01:10,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:01:10,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:01:10,619 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:01:10,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:01:10,620 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 01:01:10,620 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 01:01:10,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:01:10,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:01:10,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:01:10,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:01:10,621 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_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC 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 -> a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e [2024-11-24 01:01:10,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:01:10,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:01:10,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:01:10,984 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:01:10,984 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:01:10,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2024-11-24 01:01:14,486 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/data/e12395628/149a0e9475c94cbfb2d823e074d5cbf5/FLAG908a16717 [2024-11-24 01:01:14,836 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:01:14,837 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2024-11-24 01:01:14,861 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/data/e12395628/149a0e9475c94cbfb2d823e074d5cbf5/FLAG908a16717 [2024-11-24 01:01:15,059 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/data/e12395628/149a0e9475c94cbfb2d823e074d5cbf5 [2024-11-24 01:01:15,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:01:15,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:01:15,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:01:15,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:01:15,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:01:15,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:01:15" (1/1) ... [2024-11-24 01:01:15,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710c614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15, skipping insertion in model container [2024-11-24 01:01:15,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:01:15" (1/1) ... [2024-11-24 01:01:15,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:01:15,273 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_4af720d3-35e9-4043-9058-675fa5cbfb87/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2024-11-24 01:01:15,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:01:15,296 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:01:15,343 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_4af720d3-35e9-4043-9058-675fa5cbfb87/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2024-11-24 01:01:15,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:01:15,371 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:01:15,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15 WrapperNode [2024-11-24 01:01:15,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:01:15,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:01:15,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:01:15,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:01:15,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15" (1/1) ... [2024-11-24 01:01:15,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15" (1/1) ... [2024-11-24 01:01:15,416 INFO L138 Inliner]: procedures = 19, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 151 [2024-11-24 01:01:15,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:01:15,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:01:15,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:01:15,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:01:15,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15" (1/1) ... [2024-11-24 01:01:15,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15" (1/1) ... [2024-11-24 01:01:15,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15" (1/1) ... [2024-11-24 01:01:15,446 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-24 01:01:15,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15" (1/1) ... [2024-11-24 01:01:15,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15" (1/1) ... [2024-11-24 01:01:15,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15" (1/1) ... [2024-11-24 01:01:15,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15" (1/1) ... [2024-11-24 01:01:15,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15" (1/1) ... [2024-11-24 01:01:15,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15" (1/1) ... [2024-11-24 01:01:15,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15" (1/1) ... [2024-11-24 01:01:15,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:01:15,470 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:01:15,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:01:15,471 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:01:15,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15" (1/1) ... [2024-11-24 01:01:15,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:01:15,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:01:15,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:01:15,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:01:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:01:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-24 01:01:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-24 01:01:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-24 01:01:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-24 01:01:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-24 01:01:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 01:01:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-24 01:01:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-24 01:01:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-24 01:01:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-24 01:01:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-24 01:01:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-24 01:01:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-24 01:01:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-24 01:01:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-24 01:01:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-24 01:01:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:01:15,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:01:15,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-24 01:01:15,684 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:01:15,686 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:01:20,369 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-24 01:01:20,369 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:01:20,378 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:01:20,378 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 01:01:20,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:01:20 BoogieIcfgContainer [2024-11-24 01:01:20,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:01:20,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:01:20,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:01:20,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:01:20,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:01:15" (1/3) ... [2024-11-24 01:01:20,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50591f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:01:20, skipping insertion in model container [2024-11-24 01:01:20,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:15" (2/3) ... [2024-11-24 01:01:20,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50591f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:01:20, skipping insertion in model container [2024-11-24 01:01:20,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:01:20" (3/3) ... [2024-11-24 01:01:20,389 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+cfa-reducer.c [2024-11-24 01:01:20,405 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:01:20,408 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation2.c.v+cfa-reducer.c that has 1 procedures, 18 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-24 01:01:20,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:01:20,478 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;@67a65481, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:01:20,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:01:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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-24 01:01:20,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-24 01:01:20,490 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:20,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:20,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:01:20,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2024-11-24 01:01:20,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:01:20,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197131016] [2024-11-24 01:01:20,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:20,516 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-24 01:01:20,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:01:20,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:01:20,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:01:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:20,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 01:01:20,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:01:21,061 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-24 01:01:21,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:01:21,062 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:01:21,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197131016] [2024-11-24 01:01:21,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197131016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:21,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:21,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:01:21,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569622865] [2024-11-24 01:01:21,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:21,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:01:21,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:01:21,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:01:21,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:01:21,095 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-24 01:01:25,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:01:29,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:01:33,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:01:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:33,521 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2024-11-24 01:01:33,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:01:33,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-24 01:01:33,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:33,581 INFO L225 Difference]: With dead ends: 32 [2024-11-24 01:01:33,581 INFO L226 Difference]: Without dead ends: 18 [2024-11-24 01:01:33,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-24 01:01:33,587 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:33,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2024-11-24 01:01:33,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-24 01:01:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-11-24 01:01:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-24 01:01:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-24 01:01:33,620 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2024-11-24 01:01:33,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:33,621 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-24 01:01:33,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-24 01:01:33,621 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-11-24 01:01:33,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-24 01:01:33,621 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:33,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:33,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:01:33,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:01:33,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:01:33,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash -859311250, now seen corresponding path program 1 times [2024-11-24 01:01:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:01:33,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502866167] [2024-11-24 01:01:33,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:33,824 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-24 01:01:33,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:01:33,826 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:01:33,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:01:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:34,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:01:34,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:01:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:01:34,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:01:34,477 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:01:34,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502866167] [2024-11-24 01:01:34,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502866167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:34,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:34,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:01:34,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674848250] [2024-11-24 01:01:34,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:34,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:01:34,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:01:34,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:01:34,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:01:34,509 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:01:38,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:01:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:38,739 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-24 01:01:38,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:01:38,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-24 01:01:38,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:38,740 INFO L225 Difference]: With dead ends: 20 [2024-11-24 01:01:38,740 INFO L226 Difference]: Without dead ends: 16 [2024-11-24 01:01:38,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-24 01:01:38,741 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:38,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-11-24 01:01:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-24 01:01:38,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-24 01:01:38,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 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-24 01:01:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-24 01:01:38,745 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2024-11-24 01:01:38,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:38,745 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-24 01:01:38,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:01:38,746 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-24 01:01:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-24 01:01:38,746 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:38,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:38,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:01:38,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:01:38,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:01:38,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2024-11-24 01:01:38,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:01:38,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111874785] [2024-11-24 01:01:38,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:38,949 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-24 01:01:38,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:01:38,951 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:01:38,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:01:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:39,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-24 01:01:39,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:01:43,924 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 153 treesize of output 105 [2024-11-24 01:01:43,956 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 108 treesize of output 84 [2024-11-24 01:01:44,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:01:44,091 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 140 treesize of output 92 [2024-11-24 01:01:44,137 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 84 treesize of output 60 [2024-11-24 01:01:51,713 WARN L286 SmtUtils]: Spent 7.57s 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-24 01:02:00,283 WARN L286 SmtUtils]: Spent 5.77s 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-24 01:02:06,575 WARN L286 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:02:23,109 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_4 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_12| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse0) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_12| .cse1) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~main__t~0#1_12| .cse1)) (fp.sub c_currentRoundingMode .cse2 .cse1)))) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_12| .cse2) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-24 01:02:30,738 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-24 01:02:30,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:02:30,738 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:02:30,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111874785] [2024-11-24 01:02:30,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111874785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:02:30,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:02:30,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 01:02:30,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676589723] [2024-11-24 01:02:30,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:02:30,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 01:02:30,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:02:30,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 01:02:30,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=47, Unknown=1, NotChecked=14, Total=90 [2024-11-24 01:02:30,741 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:02:35,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:02:38,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:02:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:02:39,737 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-11-24 01:02:39,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 01:02:39,746 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-24 01:02:39,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:02:39,746 INFO L225 Difference]: With dead ends: 30 [2024-11-24 01:02:39,746 INFO L226 Difference]: Without dead ends: 25 [2024-11-24 01:02:39,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=28, Invalid=47, Unknown=1, NotChecked=14, Total=90 [2024-11-24 01:02:39,748 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:02:39,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 56 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 1 Unknown, 30 Unchecked, 9.0s Time] [2024-11-24 01:02:39,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-24 01:02:39,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2024-11-24 01:02:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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-24 01:02:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-24 01:02:39,757 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2024-11-24 01:02:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:02:39,758 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-24 01:02:39,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:02:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-24 01:02:39,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-24 01:02:39,760 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:02:39,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:02:39,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-24 01:02:39,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:02:39,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:02:39,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:02:39,961 INFO L85 PathProgramCache]: Analyzing trace with hash -858361424, now seen corresponding path program 1 times [2024-11-24 01:02:39,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:02:39,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843589042] [2024-11-24 01:02:39,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:02:39,962 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-24 01:02:39,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:02:39,966 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:02:39,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:02:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:02:40,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-24 01:02:40,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:02:44,377 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 153 treesize of output 105 [2024-11-24 01:02:44,403 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 108 treesize of output 84 [2024-11-24 01:02:44,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:02:44,508 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 140 treesize of output 92 [2024-11-24 01:02:44,535 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 84 treesize of output 60 [2024-11-24 01:02:50,877 WARN L286 SmtUtils]: Spent 6.34s 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-24 01:02:58,598 WARN L286 SmtUtils]: Spent 7.72s 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-24 01:03:17,066 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-24 01:03:22,765 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_13| (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (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_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~main__t~0#1_13| .cse1)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)) .cse2) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse1) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse0) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-24 01:03:34,160 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-24 01:03:41,920 WARN L286 SmtUtils]: Spent 7.76s 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-24 01:03:49,395 WARN L286 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:03:56,120 WARN L286 SmtUtils]: Spent 6.72s 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-24 01:04:04,259 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-24 01:04:12,680 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_13| (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (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_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~main__t~0#1_13| .cse1)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)) .cse2) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse1) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse0) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-24 01:04:24,940 WARN L286 SmtUtils]: Spent 8.08s 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-24 01:04:33,138 WARN L286 SmtUtils]: Spent 8.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-24 01:04:41,079 WARN L286 SmtUtils]: Spent 7.94s 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-24 01:04:49,218 WARN L286 SmtUtils]: Spent 8.14s 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-24 01:04:57,351 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-24 01:05:05,452 WARN L286 SmtUtils]: Spent 8.10s 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-24 01:05:13,587 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-24 01:05:21,687 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-24 01:05:25,733 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_13| (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~main__t~0#1_13| .cse1)) (fp.sub roundNearestTiesToEven .cse3 .cse1)))))) (and (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse2) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (fp.geq .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (= .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse3))))) is different from false [2024-11-24 01:05:29,762 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_13| (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~main__t~0#1_13| .cse1)) (fp.sub roundNearestTiesToEven .cse3 .cse1)))))) (and (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse2) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (fp.geq .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (= .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse3))))) is different from true [2024-11-24 01:05:40,021 WARN L286 SmtUtils]: Spent 6.22s 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-24 01:05:48,193 WARN L286 SmtUtils]: Spent 8.17s 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-24 01:05:56,299 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-24 01:06:04,426 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:06:12,545 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-24 01:06:20,165 WARN L286 SmtUtils]: Spent 7.62s on a formula simplification. DAG size of input: 32 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:06:28,272 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-24 01:06:34,806 WARN L286 SmtUtils]: Spent 6.53s 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-24 01:06:38,859 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_13| (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (not (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~main__t~0#1_13| .cse2)) (fp.sub roundNearestTiesToEven .cse3 .cse2)))) ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse0) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse3)))) is different from false [2024-11-24 01:06:42,879 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_13| (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (and (not (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~main__t~0#1_13| .cse2)) (fp.sub roundNearestTiesToEven .cse3 .cse2)))) ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse0) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32))) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse3)))) is different from true [2024-11-24 01:06:52,701 WARN L286 SmtUtils]: Spent 5.79s 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-24 01:07:00,873 WARN L286 SmtUtils]: Spent 8.17s 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-24 01:07:08,968 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-24 01:07:17,066 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-24 01:07:25,193 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-24 01:07:33,299 WARN L286 SmtUtils]: Spent 8.10s 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-24 01:07:39,585 WARN L286 SmtUtils]: Spent 6.29s 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-24 01:07:49,421 WARN L286 SmtUtils]: Spent 5.81s 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-24 01:07:57,649 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-24 01:08:05,740 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-24 01:08:13,834 WARN L286 SmtUtils]: Spent 8.09s 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-24 01:08:21,960 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-24 01:08:30,053 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-24 01:08:38,134 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-24 01:08:38,136 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-24 01:08:38,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:08:38,136 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:08:38,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843589042] [2024-11-24 01:08:38,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843589042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:08:38,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:08:38,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-24 01:08:38,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114974160] [2024-11-24 01:08:38,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:08:38,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 01:08:38,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:08:38,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 01:08:38,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=48, Unknown=6, NotChecked=68, Total=156 [2024-11-24 01:08:38,137 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-24 01:08:42,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:08:45,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:08:49,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:08:51,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:08:55,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:08:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:08:56,247 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-24 01:08:56,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 01:08:56,254 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 14 [2024-11-24 01:08:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:08:56,254 INFO L225 Difference]: With dead ends: 25 [2024-11-24 01:08:56,254 INFO L226 Difference]: Without dead ends: 17 [2024-11-24 01:08:56,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=34, Invalid=48, Unknown=6, NotChecked=68, Total=156 [2024-11-24 01:08:56,255 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:08:56,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 35 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 138 Unchecked, 18.1s Time] [2024-11-24 01:08:56,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-24 01:08:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-24 01:08:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-24 01:08:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-24 01:08:56,261 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2024-11-24 01:08:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:08:56,261 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-24 01:08:56,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-24 01:08:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-24 01:08:56,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-24 01:08:56,262 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:08:56,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:08:56,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:08:56,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:08:56,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:08:56,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:08:56,463 INFO L85 PathProgramCache]: Analyzing trace with hash 392786167, now seen corresponding path program 1 times [2024-11-24 01:08:56,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:08:56,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736631550] [2024-11-24 01:08:56,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:08:56,463 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-24 01:08:56,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:08:56,468 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:08:56,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:08:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:08:56,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-24 01:08:56,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:08:56,956 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-24 01:08:56,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:08:57,083 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-24 01:08:57,083 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:08:57,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736631550] [2024-11-24 01:08:57,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736631550] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:08:57,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:08:57,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-24 01:08:57,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248934168] [2024-11-24 01:08:57,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:08:57,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:08:57,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:08:57,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:08:57,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:08:57,085 INFO L87 Difference]: Start difference. First operand 17 states and 19 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-24 01:09:01,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:09:05,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:09:09,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:09:13,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:09:17,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:09:21,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:09:25,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:09:29,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:09:33,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:09:37,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:09:37,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:37,481 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-11-24 01:09:37,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:09:37,482 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 14 [2024-11-24 01:09:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:37,484 INFO L225 Difference]: With dead ends: 33 [2024-11-24 01:09:37,484 INFO L226 Difference]: Without dead ends: 25 [2024-11-24 01:09:37,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 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-24 01:09:37,485 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:37,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 37 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 8 Unknown, 0 Unchecked, 40.3s Time] [2024-11-24 01:09:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-24 01:09:37,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-11-24 01:09:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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-24 01:09:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-24 01:09:37,489 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2024-11-24 01:09:37,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:37,489 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-24 01:09:37,489 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-24 01:09:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-24 01:09:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-24 01:09:37,490 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:37,490 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:37,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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)] Forceful destruction successful, exit code 0 [2024-11-24 01:09:37,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:09:37,691 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:37,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:37,691 INFO L85 PathProgramCache]: Analyzing trace with hash 467686415, now seen corresponding path program 1 times [2024-11-24 01:09:37,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:09:37,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69438324] [2024-11-24 01:09:37,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:37,692 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-24 01:09:37,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:09:37,694 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:09:37,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4af720d3-35e9-4043-9058-675fa5cbfb87/bin/uautomizer-verify-LYvppIcaGC/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-24 01:09:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:38,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-24 01:09:38,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:09:44,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:09:44,066 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 155 treesize of output 107 [2024-11-24 01:09:44,105 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 108 treesize of output 84 [2024-11-24 01:09:44,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:09:44,200 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 185 treesize of output 113 [2024-11-24 01:09:44,222 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 84 treesize of output 60 [2024-11-24 01:09:59,311 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-24 01:10:04,659 WARN L286 SmtUtils]: Spent 5.35s 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-24 01:10:10,457 WARN L286 SmtUtils]: Spent 5.80s 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-24 01:10:17,427 WARN L286 SmtUtils]: Spent 6.97s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:10:26,977 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_13 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_14| (_ FloatingPoint 8 24)) (v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse6 (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15)))) (and (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~main__t~0#1_14| .cse0)) (fp.sub c_currentRoundingMode .cse4 .cse0)))) (= .cse5 .cse2) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_14| .cse4) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967281 32))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= .cse6 .cse1) (not (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_14| .cse6))))) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)) .cse5)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-24 01:10:39,109 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-24 01:10:47,194 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-24 01:10:55,281 WARN L286 SmtUtils]: Spent 8.09s 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-24 01:11:03,320 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:11:11,423 WARN L286 SmtUtils]: Spent 8.10s 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-24 01:11:19,800 WARN L286 SmtUtils]: Spent 8.38s 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-24 01:11:27,946 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-24 01:11:36,022 WARN L286 SmtUtils]: Spent 8.08s 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-24 01:11:40,083 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_13 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_14| (_ FloatingPoint 8 24)) (v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (= .cse1 .cse2) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_14| .cse3) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~main__t~0#1_14| .cse5)) (fp.sub roundNearestTiesToEven .cse3 .cse5)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)) .cse4) (= .cse5 .cse1) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (not (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_14| .cse2))))) is different from false [2024-11-24 01:11:44,100 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_13 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_14| (_ FloatingPoint 8 24)) (v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (= .cse1 .cse2) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_14| .cse3) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~main__t~0#1_14| .cse5)) (fp.sub roundNearestTiesToEven .cse3 .cse5)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)) .cse4) (= .cse5 .cse1) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (not (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_14| .cse2))))) is different from true [2024-11-24 01:11:56,200 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-24 01:12:04,270 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-24 01:12:11,506 WARN L286 SmtUtils]: Spent 7.24s 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-24 01:12:19,209 WARN L286 SmtUtils]: Spent 7.70s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:12:27,291 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-24 01:12:35,446 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-24 01:12:43,557 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-24 01:12:51,634 WARN L286 SmtUtils]: Spent 8.08s 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-24 01:13:03,737 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-24 01:13:11,811 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-24 01:13:19,882 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-24 01:13:27,158 WARN L286 SmtUtils]: Spent 7.28s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:13:35,240 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-24 01:13:43,412 WARN L286 SmtUtils]: Spent 8.17s 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-24 01:13:51,540 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-24 01:13:59,648 WARN L286 SmtUtils]: Spent 8.11s 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-24 01:14:11,748 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-24 01:14:19,825 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-24 01:14:27,897 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-24 01:14:35,846 WARN L286 SmtUtils]: Spent 7.95s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:14:43,939 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-24 01:14:52,136 WARN L286 SmtUtils]: Spent 8.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-24 01:15:00,272 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-24 01:15:08,356 WARN L286 SmtUtils]: Spent 8.08s 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-24 01:15:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:15:08,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:15:18,192 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:15:22,265 WARN L851 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) is different from false [2024-11-24 01:15:26,322 WARN L873 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) is different from true [2024-11-24 01:15:34,551 WARN L286 SmtUtils]: Spent 8.23s 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-24 01:15:42,709 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:15:46,770 WARN L851 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) is different from false [2024-11-24 01:15:50,842 WARN L873 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) is different from true [2024-11-24 01:15:59,132 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:16:07,282 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:16:11,348 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from false [2024-11-24 01:16:15,430 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from true [2024-11-24 01:16:23,706 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)