./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd --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 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:09:24,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:09:24,906 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:09:24,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:09:24,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:09:24,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:09:24,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:09:24,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:09:24,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:09:24,959 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:09:24,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:09:24,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:09:24,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:09:24,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:09:24,961 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:09:24,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:09:24,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:09:24,961 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:09:24,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:09:24,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:09:24,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:09:24,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:09:24,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:09:24,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:09:24,963 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:09:24,964 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:09:24,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:09:24,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:09:24,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:09:24,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:09:24,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:09:24,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:09:24,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:09:24,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:09:24,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:09:24,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:09:24,965 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:09:24,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:09:24,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:09:24,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:09:24,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:09:24,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:09:24,966 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_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd 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 -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2024-11-13 14:09:25,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:09:25,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:09:25,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:09:25,377 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:09:25,377 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:09:25,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/float-benchs/interpolation.c Unable to find full path for "g++" [2024-11-13 14:09:27,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:09:27,938 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:09:27,939 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/sv-benchmarks/c/float-benchs/interpolation.c [2024-11-13 14:09:27,956 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/data/a6df2243b/342c175d18354252b366c97167fd1300/FLAGfc2d90fc1 [2024-11-13 14:09:28,158 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/data/a6df2243b/342c175d18354252b366c97167fd1300 [2024-11-13 14:09:28,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:09:28,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:09:28,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:09:28,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:09:28,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:09:28,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:09:28" (1/1) ... [2024-11-13 14:09:28,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d7daeab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:28, skipping insertion in model container [2024-11-13 14:09:28,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:09:28" (1/1) ... [2024-11-13 14:09:28,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:09:28,411 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_d29cd6f0-07be-4cb3-960f-32374eddfaa7/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2024-11-13 14:09:28,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:09:28,458 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:09:28,473 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_d29cd6f0-07be-4cb3-960f-32374eddfaa7/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2024-11-13 14:09:28,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:09:28,517 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:09:28,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:28 WrapperNode [2024-11-13 14:09:28,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:09:28,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:09:28,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:09:28,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:09:28,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:28" (1/1) ... [2024-11-13 14:09:28,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:28" (1/1) ... [2024-11-13 14:09:28,566 INFO L138 Inliner]: procedures = 18, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2024-11-13 14:09:28,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:09:28,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:09:28,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:09:28,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:09:28,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:28" (1/1) ... [2024-11-13 14:09:28,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:28" (1/1) ... [2024-11-13 14:09:28,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:28" (1/1) ... [2024-11-13 14:09:28,613 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2024-11-13 14:09:28,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:28" (1/1) ... [2024-11-13 14:09:28,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:28" (1/1) ... [2024-11-13 14:09:28,628 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:28" (1/1) ... [2024-11-13 14:09:28,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:28" (1/1) ... [2024-11-13 14:09:28,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:28" (1/1) ... [2024-11-13 14:09:28,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:28" (1/1) ... [2024-11-13 14:09:28,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:09:28,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:09:28,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:09:28,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:09:28,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:28" (1/1) ... [2024-11-13 14:09:28,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:09:28,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:09:28,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:09:28,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:09:28,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:09:28,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:09:28,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:09:28,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:09:28,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 14:09:28,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 14:09:28,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 14:09:28,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 14:09:28,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:09:28,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:09:28,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 14:09:28,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 14:09:28,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 14:09:28,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:09:28,829 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:09:28,831 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:09:29,030 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-13 14:09:29,031 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:09:29,047 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:09:29,047 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:09:29,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:09:29 BoogieIcfgContainer [2024-11-13 14:09:29,048 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:09:29,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:09:29,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:09:29,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:09:29,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:09:28" (1/3) ... [2024-11-13 14:09:29,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57367fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:09:29, skipping insertion in model container [2024-11-13 14:09:29,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:28" (2/3) ... [2024-11-13 14:09:29,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57367fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:09:29, skipping insertion in model container [2024-11-13 14:09:29,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:09:29" (3/3) ... [2024-11-13 14:09:29,066 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c [2024-11-13 14:09:29,088 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:09:29,090 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation.c that has 1 procedures, 16 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:09:29,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:09:29,188 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;@655120ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:09:29,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:09:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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-13 14:09:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 14:09:29,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:29,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:29,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:29,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:29,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1236162952, now seen corresponding path program 1 times [2024-11-13 14:09:29,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:09:29,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699524784] [2024-11-13 14:09:29,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:29,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:09:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:29,419 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-13 14:09:29,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:09:29,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699524784] [2024-11-13 14:09:29,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699524784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:09:29,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:09:29,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:09:29,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572060196] [2024-11-13 14:09:29,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:09:29,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:09:29,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:09:29,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:09:29,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:09:29,457 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:09:29,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:29,471 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-11-13 14:09:29,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:09:29,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-13 14:09:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:29,481 INFO L225 Difference]: With dead ends: 27 [2024-11-13 14:09:29,481 INFO L226 Difference]: Without dead ends: 12 [2024-11-13 14:09:29,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:09:29,491 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:09:29,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:09:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-13 14:09:29,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-13 14:09:29,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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-13 14:09:29,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-11-13 14:09:29,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2024-11-13 14:09:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:29,523 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-13 14:09:29,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:09:29,524 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2024-11-13 14:09:29,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 14:09:29,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:29,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:29,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:09:29,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:29,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:29,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1178904650, now seen corresponding path program 1 times [2024-11-13 14:09:29,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:09:29,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211920334] [2024-11-13 14:09:29,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:29,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:09:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:29,658 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-13 14:09:29,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:09:29,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211920334] [2024-11-13 14:09:29,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211920334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:09:29,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:09:29,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:09:29,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665326785] [2024-11-13 14:09:29,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:09:29,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:09:29,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:09:29,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:09:29,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:09:29,661 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:09:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:29,680 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2024-11-13 14:09:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:09:29,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-13 14:09:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:29,681 INFO L225 Difference]: With dead ends: 22 [2024-11-13 14:09:29,681 INFO L226 Difference]: Without dead ends: 18 [2024-11-13 14:09:29,682 INFO L431 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-13 14:09:29,683 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 21 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-13 14:09:29,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:09:29,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-13 14:09:29,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2024-11-13 14:09:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:09:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-13 14:09:29,687 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2024-11-13 14:09:29,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:29,688 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-13 14:09:29,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:09:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-11-13 14:09:29,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 14:09:29,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:29,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:29,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:09:29,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:29,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:29,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2110326903, now seen corresponding path program 1 times [2024-11-13 14:09:29,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:09:29,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138428048] [2024-11-13 14:09:29,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:29,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:09:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:09:29,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:09:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:09:29,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:09:29,774 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:09:29,775 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:09:29,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:09:29,781 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 14:09:29,805 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:09:29,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:09:29 BoogieIcfgContainer [2024-11-13 14:09:29,809 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:09:29,810 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:09:29,810 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:09:29,810 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:09:29,811 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:09:29" (3/4) ... [2024-11-13 14:09:29,814 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:09:29,815 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:09:29,817 INFO L158 Benchmark]: Toolchain (without parser) took 1653.72ms. Allocated memory is still 142.6MB. Free memory was 118.7MB in the beginning and 63.5MB in the end (delta: 55.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-13 14:09:29,817 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 142.6MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:09:29,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.84ms. Allocated memory is still 142.6MB. Free memory was 118.7MB in the beginning and 107.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:09:29,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.57ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 106.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:09:29,819 INFO L158 Benchmark]: Boogie Preprocessor took 71.81ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 104.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:09:29,819 INFO L158 Benchmark]: RCFGBuilder took 403.55ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 93.4MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:09:29,820 INFO L158 Benchmark]: TraceAbstraction took 755.51ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 63.7MB in the end (delta: 28.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:09:29,820 INFO L158 Benchmark]: Witness Printer took 5.64ms. Allocated memory is still 142.6MB. Free memory was 63.7MB in the beginning and 63.5MB in the end (delta: 265.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:09:29,824 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.40ms. Allocated memory is still 142.6MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.84ms. Allocated memory is still 142.6MB. Free memory was 118.7MB in the beginning and 107.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.57ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 106.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.81ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 104.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 403.55ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 93.4MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 755.51ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 63.7MB in the end (delta: 28.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 5.64ms. Allocated memory is still 142.6MB. Free memory was 63.7MB in the beginning and 63.5MB in the end (delta: 265.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 9]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 22, overapproximation of someBinaryFLOATComparisonOperation at line 19, overapproximation of someBinaryFLOATComparisonOperation at line 26, overapproximation of someBinaryFLOATComparisonOperation at line 19, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 24. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L18] t = __VERIFIER_nondet_float() [L19] EXPR min[0] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] VAL [max={5:0}] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] VAL [max={5:0}] [L19] CALL assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L7] COND FALSE !(!cond) [L19] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L21] i = 0 VAL [i=0, max={5:0}] [L21] COND TRUE i < sizeof(min) / sizeof(min[0]) [L22] EXPR max[i] [L22] COND TRUE t <= max[i] [L24] EXPR min[i] [L24] EXPR max[i] [L24] EXPR min[i] [L24] z = (t - min[i]) / (max[i] - min[i]) [L26] CALL __VERIFIER_assert(z >= 0.f && z <= 1.f) [L9] COND TRUE !(cond) [L9] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 30 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 14:09:29,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd --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 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:09:32,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:09:32,672 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:09:32,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:09:32,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:09:32,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:09:32,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:09:32,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:09:32,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:09:32,760 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:09:32,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:09:32,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:09:32,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:09:32,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:09:32,761 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:09:32,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:09:32,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:09:32,766 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:09:32,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:09:32,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:09:32,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:09:32,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:09:32,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:09:32,767 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:09:32,767 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:09:32,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:09:32,767 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:09:32,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:09:32,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:09:32,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:09:32,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:09:32,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:09:32,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:09:32,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:09:32,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:09:32,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:09:32,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:09:32,768 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:09:32,769 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:09:32,769 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:09:32,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:09:32,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:09:32,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:09:32,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:09:32,775 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_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd 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 -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2024-11-13 14:09:33,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:09:33,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:09:33,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:09:33,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:09:33,203 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:09:33,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/float-benchs/interpolation.c Unable to find full path for "g++" [2024-11-13 14:09:35,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:09:35,740 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:09:35,741 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/sv-benchmarks/c/float-benchs/interpolation.c [2024-11-13 14:09:35,756 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/data/3cf8f4a49/90269c7f7ef84a159a2bdbc693b82030/FLAG50cf4d18e [2024-11-13 14:09:35,787 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/data/3cf8f4a49/90269c7f7ef84a159a2bdbc693b82030 [2024-11-13 14:09:35,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:09:35,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:09:35,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:09:35,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:09:35,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:09:35,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:09:35" (1/1) ... [2024-11-13 14:09:35,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b4ddea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:35, skipping insertion in model container [2024-11-13 14:09:35,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:09:35" (1/1) ... [2024-11-13 14:09:35,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:09:36,058 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_d29cd6f0-07be-4cb3-960f-32374eddfaa7/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2024-11-13 14:09:36,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:09:36,124 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:09:36,140 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_d29cd6f0-07be-4cb3-960f-32374eddfaa7/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2024-11-13 14:09:36,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:09:36,193 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:09:36,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:36 WrapperNode [2024-11-13 14:09:36,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:09:36,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:09:36,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:09:36,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:09:36,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:36" (1/1) ... [2024-11-13 14:09:36,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:36" (1/1) ... [2024-11-13 14:09:36,254 INFO L138 Inliner]: procedures = 19, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-11-13 14:09:36,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:09:36,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:09:36,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:09:36,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:09:36,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:36" (1/1) ... [2024-11-13 14:09:36,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:36" (1/1) ... [2024-11-13 14:09:36,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:36" (1/1) ... [2024-11-13 14:09:36,303 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2024-11-13 14:09:36,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:36" (1/1) ... [2024-11-13 14:09:36,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:36" (1/1) ... [2024-11-13 14:09:36,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:36" (1/1) ... [2024-11-13 14:09:36,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:36" (1/1) ... [2024-11-13 14:09:36,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:36" (1/1) ... [2024-11-13 14:09:36,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:36" (1/1) ... [2024-11-13 14:09:36,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:09:36,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:09:36,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:09:36,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:09:36,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:36" (1/1) ... [2024-11-13 14:09:36,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:09:36,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:09:36,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:09:36,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:09:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:09:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-13 14:09:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-13 14:09:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-13 14:09:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:09:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 14:09:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 14:09:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 14:09:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 14:09:36,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 14:09:36,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-13 14:09:36,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:09:36,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:09:36,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:09:36,565 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:09:36,569 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:09:39,294 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-13 14:09:39,295 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:09:39,307 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:09:39,308 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:09:39,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:09:39 BoogieIcfgContainer [2024-11-13 14:09:39,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:09:39,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:09:39,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:09:39,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:09:39,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:09:35" (1/3) ... [2024-11-13 14:09:39,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c57fd94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:09:39, skipping insertion in model container [2024-11-13 14:09:39,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:09:36" (2/3) ... [2024-11-13 14:09:39,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c57fd94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:09:39, skipping insertion in model container [2024-11-13 14:09:39,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:09:39" (3/3) ... [2024-11-13 14:09:39,326 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c [2024-11-13 14:09:39,347 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:09:39,349 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation.c that has 1 procedures, 16 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:09:39,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:09:39,450 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;@6113c680, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:09:39,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:09:39,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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-13 14:09:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 14:09:39,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:39,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:39,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:39,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:39,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1236162952, now seen corresponding path program 1 times [2024-11-13 14:09:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:09:39,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137874849] [2024-11-13 14:09:39,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:39,493 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-13 14:09:39,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:09:39,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:09:39,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:09:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:40,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:09:40,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:40,064 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-13 14:09:40,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:09:40,065 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:09:40,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137874849] [2024-11-13 14:09:40,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137874849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:09:40,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:09:40,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:09:40,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351819465] [2024-11-13 14:09:40,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:09:40,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:09:40,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:09:40,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:09:40,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:09:40,102 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:09:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:40,116 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-11-13 14:09:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:09:40,119 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-13 14:09:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:40,127 INFO L225 Difference]: With dead ends: 27 [2024-11-13 14:09:40,127 INFO L226 Difference]: Without dead ends: 12 [2024-11-13 14:09:40,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:09:40,135 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:09:40,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:09:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-13 14:09:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-13 14:09:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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-13 14:09:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-11-13 14:09:40,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2024-11-13 14:09:40,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:40,172 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-13 14:09:40,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:09:40,173 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2024-11-13 14:09:40,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 14:09:40,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:40,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:40,182 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:09:40,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:09:40,375 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:40,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:40,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1178904650, now seen corresponding path program 1 times [2024-11-13 14:09:40,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:09:40,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752580013] [2024-11-13 14:09:40,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:40,377 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-13 14:09:40,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:09:40,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:09:40,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:09:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:40,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:09:40,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:40,890 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-13 14:09:40,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:09:40,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:09:40,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752580013] [2024-11-13 14:09:40,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752580013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:09:40,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:09:40,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:09:40,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805995197] [2024-11-13 14:09:40,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:09:40,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:09:40,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:09:40,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:09:40,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:09:40,898 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:09:45,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:09:46,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:09:46,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:09:46,613 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-11-13 14:09:46,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:09:46,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-13 14:09:46,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:09:46,615 INFO L225 Difference]: With dead ends: 19 [2024-11-13 14:09:46,615 INFO L226 Difference]: Without dead ends: 15 [2024-11-13 14:09:46,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:09:46,617 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:09:46,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 19 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2024-11-13 14:09:46,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-13 14:09:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2024-11-13 14:09:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:09:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-13 14:09:46,623 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2024-11-13 14:09:46,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:09:46,623 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-13 14:09:46,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:09:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-11-13 14:09:46,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 14:09:46,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:09:46,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:09:46,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:09:46,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:09:46,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:09:46,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:09:46,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2110326903, now seen corresponding path program 1 times [2024-11-13 14:09:46,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:09:46,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602700038] [2024-11-13 14:09:46,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:09:46,827 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-13 14:09:46,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:09:46,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:09:46,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:09:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:09:47,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 14:09:47,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:09:50,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:09:50,374 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 348 treesize of output 264 [2024-11-13 14:09:50,399 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 277 treesize of output 157 [2024-11-13 14:10:06,029 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-13 14:10:06,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:10:06,030 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:10:06,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602700038] [2024-11-13 14:10:06,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602700038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:06,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:06,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 14:10:06,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617946665] [2024-11-13 14:10:06,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:06,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:10:06,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:10:06,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:10:06,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:10:06,032 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.0) internal successors, (11), 10 states have internal predecessors, (11), 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-13 14:10:07,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:10:09,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:10:12,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:10:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:12,102 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-11-13 14:10:12,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:10:12,103 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.0) internal successors, (11), 10 states have internal predecessors, (11), 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 11 [2024-11-13 14:10:12,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:10:12,105 INFO L225 Difference]: With dead ends: 25 [2024-11-13 14:10:12,106 INFO L226 Difference]: Without dead ends: 21 [2024-11-13 14:10:12,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:10:12,107 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:10:12,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 25 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-13 14:10:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-13 14:10:12,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-11-13 14:10:12,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:10:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-13 14:10:12,120 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2024-11-13 14:10:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:10:12,121 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-13 14:10:12,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.0) internal successors, (11), 10 states have internal predecessors, (11), 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-13 14:10:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-13 14:10:12,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 14:10:12,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:10:12,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:10:12,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-13 14:10:12,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:10:12,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:10:12,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:12,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1504582023, now seen corresponding path program 1 times [2024-11-13 14:10:12,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:10:12,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392095979] [2024-11-13 14:10:12,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:12,328 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-13 14:10:12,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:10:12,337 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:10:12,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:10:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:12,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:10:12,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:10:12,791 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-13 14:10:12,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:10:12,791 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:10:12,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392095979] [2024-11-13 14:10:12,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392095979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:10:12,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:10:12,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:10:12,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764219025] [2024-11-13 14:10:12,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:10:12,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:10:12,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:10:12,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:10:12,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:10:12,795 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-13 14:10:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:12,860 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-11-13 14:10:12,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:10:12,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-11-13 14:10:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:10:12,861 INFO L225 Difference]: With dead ends: 24 [2024-11-13 14:10:12,862 INFO L226 Difference]: Without dead ends: 14 [2024-11-13 14:10:12,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:10:12,864 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:10:12,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:10:12,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-13 14:10:12,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-13 14:10:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:10:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-13 14:10:12,874 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2024-11-13 14:10:12,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:10:12,877 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-13 14:10:12,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-13 14:10:12,878 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-13 14:10:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 14:10:12,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:10:12,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:10:12,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:10:13,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:10:13,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:10:13,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:13,081 INFO L85 PathProgramCache]: Analyzing trace with hash 997140987, now seen corresponding path program 1 times [2024-11-13 14:10:13,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:10:13,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492992765] [2024-11-13 14:10:13,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:13,082 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-13 14:10:13,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:10:13,085 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:10:13,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:10:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:13,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:10:13,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:10:13,594 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-13 14:10:13,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:10:13,673 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-13 14:10:13,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:10:13,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492992765] [2024-11-13 14:10:13,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492992765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:10:13,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:10:13,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-13 14:10:13,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292815012] [2024-11-13 14:10:13,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:10:13,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:10:13,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:10:13,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:10:13,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:10:13,679 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:10:17,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:10:18,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:10:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:10:19,236 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-11-13 14:10:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:10:19,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-13 14:10:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:10:19,242 INFO L225 Difference]: With dead ends: 26 [2024-11-13 14:10:19,242 INFO L226 Difference]: Without dead ends: 22 [2024-11-13 14:10:19,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:10:19,243 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:10:19,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 25 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2024-11-13 14:10:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-13 14:10:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-13 14:10:19,254 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-13 14:10:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-13 14:10:19,256 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2024-11-13 14:10:19,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:10:19,257 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-13 14:10:19,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:10:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-13 14:10:19,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 14:10:19,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:10:19,258 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:10:19,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:10:19,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:10:19,458 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:10:19,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:10:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash 848264914, now seen corresponding path program 1 times [2024-11-13 14:10:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:10:19,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297490177] [2024-11-13 14:10:19,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:10:19,460 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-13 14:10:19,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:10:19,461 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:10:19,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:10:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:10:19,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 14:10:19,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:10:23,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:10:23,765 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 393 treesize of output 285 [2024-11-13 14:10:23,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:10:23,811 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 279 treesize of output 159 [2024-11-13 14:10:31,934 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-13 14:10:39,532 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-13 14:10:39,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:10:45,931 WARN L286 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:10:53,840 WARN L286 SmtUtils]: Spent 7.91s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:00,926 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from true [2024-11-13 14:11:11,529 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:19,665 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:27,645 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|))) is different from true [2024-11-13 14:11:35,071 WARN L286 SmtUtils]: Spent 7.42s 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-13 14:11:40,899 WARN L286 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:11:47,937 WARN L286 SmtUtils]: Spent 7.04s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:13:22,387 WARN L286 SmtUtils]: Spent 17.21s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:13:28,944 WARN L286 SmtUtils]: Spent 6.55s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:13:37,036 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:13:53,576 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse4 (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse4 (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))))))) is different from true [2024-11-13 14:14:03,068 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:14:14,709 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse3 (let ((.cse7 (select .cse1 (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse3)) (let ((.cse4 (let ((.cse5 (let ((.cse6 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse2 (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5) (fp.sub c_currentRoundingMode .cse3 .cse5))))) (and (fp.geq .cse4 (_ +zero 8 24)) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))))))) is different from true [2024-11-13 14:14:21,649 WARN L286 SmtUtils]: Spent 6.94s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:14:29,709 WARN L286 SmtUtils]: Spent 8.06s 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-13 14:14:44,833 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse6 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse1 (_ +zero 8 24)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) is different from true [2024-11-13 14:14:51,709 WARN L286 SmtUtils]: Spent 6.87s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:14:57,741 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:15:03,675 WARN L286 SmtUtils]: Spent 5.93s 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-13 14:15:09,374 WARN L286 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:15:14,985 WARN L286 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:15:21,103 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse6 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse1 (_ +zero 8 24)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) is different from true [2024-11-13 14:15:27,879 WARN L286 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:15:35,793 WARN L286 SmtUtils]: Spent 7.91s 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-13 14:15:43,946 WARN L286 SmtUtils]: Spent 6.56s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:16:49,352 WARN L286 SmtUtils]: Spent 24.41s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:16:59,228 WARN L286 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:17:06,690 WARN L286 SmtUtils]: Spent 7.46s 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-13 14:17:20,917 WARN L286 SmtUtils]: Spent 7.94s on a formula simplification that was a NOOP. DAG size: 2 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:17:27,512 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse7 (select .cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (not |c_ULTIMATE.start_main_#t~short7#1|) (let ((.cse3 (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse0 .cse4))))) (and (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse3 (_ +zero 8 24)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse2 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))))) is different from true [2024-11-13 14:17:29,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:17:29,283 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 273 treesize of output 1 [2024-11-13 14:17:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-13 14:17:29,284 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:17:29,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297490177] [2024-11-13 14:17:29,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297490177] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:17:29,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:17:29,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2024-11-13 14:17:29,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024176862] [2024-11-13 14:17:29,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:17:29,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 14:17:29,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:17:29,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 14:17:29,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=178, Unknown=19, NotChecked=238, Total=506 [2024-11-13 14:17:29,286 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 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-13 14:17:33,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:17:34,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:17:38,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:18:11,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:18:36,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:18:40,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse12 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse7 (let ((.cse17 (select .cse12 (_ bv0 32)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse1 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse2 (let ((.cse16 (select .cse5 (_ bv16 32)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (and (let ((.cse0 (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))) (or (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and .cse1 (not .cse0)))) (= .cse3 (let ((.cse4 (select .cse5 (_ bv0 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (= (let ((.cse6 (select .cse5 (_ bv4 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#max~0#1.offset|) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse7) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse7) (let ((.cse8 (let ((.cse14 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (or .cse1 (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse8)) (let ((.cse9 (let ((.cse10 (let ((.cse11 (select .cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse10) (fp.sub c_currentRoundingMode .cse8 .cse10))))) (and (fp.leq .cse9 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse9 (_ +zero 8 24)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse13 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#min~0#1.offset|) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= (let ((.cse15 (select .cse12 (_ bv4 32)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))) .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-13 14:18:44,891 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse12 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse7 (let ((.cse17 (select .cse12 (_ bv0 32)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse1 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse2 (let ((.cse16 (select .cse5 (_ bv16 32)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (and (let ((.cse0 (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))) (or (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and .cse1 (not .cse0)))) (= .cse3 (let ((.cse4 (select .cse5 (_ bv0 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (= (let ((.cse6 (select .cse5 (_ bv4 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#max~0#1.offset|) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse7) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse7) (let ((.cse8 (let ((.cse14 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (or .cse1 (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse8)) (let ((.cse9 (let ((.cse10 (let ((.cse11 (select .cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse10) (fp.sub c_currentRoundingMode .cse8 .cse10))))) (and (fp.leq .cse9 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse9 (_ +zero 8 24)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse13 (select .cse5 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#min~0#1.offset|) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= (let ((.cse15 (select .cse12 (_ bv4 32)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))) .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 14:18:51,510 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse12 (let ((.cse15 (select .cse4 (_ bv0 32)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse11 (let ((.cse14 (select .cse6 (_ bv16 32)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (.cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (and (let ((.cse0 (let ((.cse7 (select .cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (select .cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse1 (_ +zero 8 24)))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))) (= .cse8 (let ((.cse9 (select .cse6 (_ bv0 32)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (= (let ((.cse10 (select .cse6 (_ bv4 32)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#max~0#1.offset|) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse11) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse12) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse12) (= (_ bv0 32) |c_ULTIMATE.start_main_~#min~0#1.offset|) (= .cse11 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= (let ((.cse13 (select .cse4 (_ bv4 32)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))) .cse8) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 14:18:58,508 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse12 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse5 (let ((.cse16 (select .cse12 (_ bv0 32)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse4 (let ((.cse15 (select .cse2 (_ bv16 32)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) (= .cse0 (let ((.cse1 (select .cse2 (_ bv0 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (let ((.cse3 (select .cse2 (_ bv4 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#max~0#1.offset|) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse4) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse5) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse5) (= (_ bv0 32) |c_ULTIMATE.start_main_~#min~0#1.offset|) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (let ((.cse7 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse8 (let ((.cse13 (select .cse2 (bvadd .cse7 (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (or (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse6 (select .cse2 (bvadd .cse7 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse8)) (let ((.cse9 (let ((.cse10 (let ((.cse11 (select .cse12 (bvadd .cse7 (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse10) (fp.sub c_currentRoundingMode .cse8 .cse10))))) (and (fp.geq .cse9 (_ +zero 8 24)) (fp.leq .cse9 ((_ to_fp 8 24) c_currentRoundingMode 1.0))))))) (= (let ((.cse14 (select .cse12 (_ bv4 32)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))) .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 14:19:50,508 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse1 (let ((.cse15 (select .cse3 (_ bv0 32)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 (let ((.cse14 (select .cse3 (_ bv16 32)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (.cse9 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (and (= .cse0 .cse1) (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse1)) (= (let ((.cse2 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#max~0#1.offset|) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse4) (let ((.cse10 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse7 (let ((.cse11 (select .cse3 (bvadd .cse10 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (or (let ((.cse5 (let ((.cse6 (let ((.cse8 (select .cse9 (bvadd .cse10 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse6) (fp.sub c_currentRoundingMode .cse7 .cse6))))) (and (fp.geq .cse5 (_ +zero 8 24)) (fp.leq .cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse7))))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) (let ((.cse12 (select .cse9 (_ bv0 32)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#min~0#1.offset|) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= (let ((.cse13 (select .cse9 (_ bv4 32)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))) .cse0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 14:19:56,479 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse1 (let ((.cse15 (select .cse10 (_ bv0 32)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse2 (let ((.cse14 (select .cse10 (_ bv4 32)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (.cse3 (let ((.cse13 (select .cse10 (_ bv16 32)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse5 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|))) (and (= .cse0 .cse1) (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse1)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#max~0#1.offset|) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse3) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) (let ((.cse4 (select .cse5 (_ bv0 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (= |c_ULTIMATE.start_main_#t~mem8#1| .cse2) (= (_ bv0 32) |c_ULTIMATE.start_main_~#min~0#1.offset|) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= (let ((.cse6 (select .cse5 (_ bv4 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) .cse0) (or (let ((.cse7 (let ((.cse11 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse8 (let ((.cse12 (select .cse5 (bvadd .cse11 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse8) (fp.sub c_currentRoundingMode (let ((.cse9 (select .cse10 (bvadd .cse11 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) .cse8)))))) (and (fp.geq .cse7 (_ +zero 8 24)) (fp.leq .cse7 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem8#1|))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 14:20:02,015 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|)) (.cse7 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse14 (select .cse7 (_ bv0 32)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (.cse3 (let ((.cse13 (select .cse7 (_ bv4 32)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse0 (let ((.cse11 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse9 (let ((.cse12 (select .cse5 (bvadd .cse11 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse9) (fp.sub c_currentRoundingMode (let ((.cse10 (select .cse7 (bvadd .cse11 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) .cse9))))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (and (fp.geq .cse0 (_ +zero 8 24)) (= .cse1 .cse2) (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#max~0#1.offset|) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse3) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) (let ((.cse4 (select .cse5 (_ bv0 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#min~0#1.offset|) (= (let ((.cse6 (select .cse7 (_ bv16 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= (let ((.cse8 (select .cse5 (_ bv4 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 14:20:06,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:20:10,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:20:12,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:20:14,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:20:18,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:20:21,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:20:25,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:20:28,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:20:32,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:20:34,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:20:38,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:20:42,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:20:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:42,093 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-11-13 14:20:42,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:20:42,126 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 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) Word has length 13 [2024-11-13 14:20:42,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:42,127 INFO L225 Difference]: With dead ends: 23 [2024-11-13 14:20:42,127 INFO L226 Difference]: Without dead ends: 19 [2024-11-13 14:20:42,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 340.1s TimeCoverageRelationStatistics Valid=100, Invalid=262, Unknown=32, NotChecked=598, Total=992 [2024-11-13 14:20:42,129 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 57.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:42,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 9 Unknown, 223 Unchecked, 57.9s Time] [2024-11-13 14:20:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-13 14:20:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-13 14:20:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-13 14:20:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-13 14:20:42,136 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2024-11-13 14:20:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:42,136 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-13 14:20:42,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 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-13 14:20:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-13 14:20:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 14:20:42,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:42,138 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:42,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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)] Ended with exit code 0 [2024-11-13 14:20:42,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:20:42,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:20:42,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:42,339 INFO L85 PathProgramCache]: Analyzing trace with hash -812529043, now seen corresponding path program 2 times [2024-11-13 14:20:42,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:20:42,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063193192] [2024-11-13 14:20:42,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:20:42,340 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-13 14:20:42,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:20:42,342 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:20:42,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d29cd6f0-07be-4cb3-960f-32374eddfaa7/bin/uautomizer-verify-qhAvR1uOyd/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 (8)] Waiting until timeout for monitored process [2024-11-13 14:20:42,865 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:20:42,865 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:20:42,877 WARN L253 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 14:20:42,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:20:49,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:20:49,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 439 treesize of output 307 [2024-11-13 14:20:49,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:20:49,434 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 279 treesize of output 159 [2024-11-13 14:20:57,298 WARN L286 SmtUtils]: Spent 7.84s 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-13 14:21:13,963 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-13 14:21:22,735 WARN L286 SmtUtils]: Spent 5.46s 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-13 14:21:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:21:30,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:21:39,095 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:21:47,212 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:21:51,246 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from false [2024-11-13 14:22:01,892 WARN L286 SmtUtils]: Spent 7.30s 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-13 14:22:10,030 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:22:16,514 WARN L286 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:23:47,840 WARN L286 SmtUtils]: Spent 19.60s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:23:55,966 WARN L286 SmtUtils]: Spent 8.12s 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-13 14:24:04,110 WARN L286 SmtUtils]: Spent 8.14s 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-13 14:24:10,696 WARN L286 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:24:16,502 WARN L286 SmtUtils]: Spent 5.81s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:24:23,417 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse4 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse4 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (bvult |c_ULTIMATE.start_main_~i~0#1| (_ bv5 32))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from true [2024-11-13 14:24:33,016 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:24:39,737 WARN L286 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:24:47,581 WARN L286 SmtUtils]: Spent 7.84s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)